Base | Representation |
---|---|
bin | 100000001101010011001… |
… | …001010010010000001111 |
3 | 21211120220220021001112212 |
4 | 200031103021102100033 |
5 | 242230321043203211 |
6 | 4412435530421035 |
7 | 315622466641313 |
oct | 40152311222017 |
9 | 7746826231485 |
10 | 2213303100431 |
11 | 783724999265 |
12 | 2b8b5289177b |
13 | 13093799a2b7 |
14 | 791a5679b43 |
15 | 3c88e2c638b |
hex | 2035325240f |
2213303100431 has 2 divisors, whose sum is σ = 2213303100432. Its totient is φ = 2213303100430.
The previous prime is 2213303100401. The next prime is 2213303100433. The reversal of 2213303100431 is 1340013033122.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2213303100431 - 26 = 2213303100367 is a prime.
It is a super-2 number, since 2×22133031004312 (a number of 25 digits) contains 22 as substring.
Together with 2213303100433, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 2213303100397 and 2213303100406.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2213303100433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1106651550215 + 1106651550216.
It is an arithmetic number, because the mean of its divisors is an integer number (1106651550216).
Almost surely, 22213303100431 is an apocalyptic number.
2213303100431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2213303100431 is an equidigital number, since it uses as much as digits as its factorization.
2213303100431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1296, while the sum is 23.
Adding to 2213303100431 its reverse (1340013033122), we get a palindrome (3553316133553).
The spelling of 2213303100431 in words is "two trillion, two hundred thirteen billion, three hundred three million, one hundred thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •