Base | Representation |
---|---|
bin | 1001010010011010101011… |
… | …1000100111101101001011 |
3 | 1100011020222010121002220101 |
4 | 2110212222320213231023 |
5 | 2314303141040411021 |
6 | 33415155135310231 |
7 | 2102535661522261 |
oct | 224465270475513 |
9 | 40136863532811 |
10 | 10212004232011 |
11 | 328798318741a |
12 | 118b1a367b377 |
13 | 590cac46155a |
14 | 274399610431 |
15 | 12a9871c1a91 |
hex | 949aae27b4b |
10212004232011 has 2 divisors, whose sum is σ = 10212004232012. Its totient is φ = 10212004232010.
The previous prime is 10212004231921. The next prime is 10212004232029. The reversal of 10212004232011 is 11023240021201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10212004232011 - 27 = 10212004231883 is a prime.
It is a super-2 number, since 2×102120042320112 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 10212004232011.
It is not a weakly prime, because it can be changed into another prime (10212004232611) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5106002116005 + 5106002116006.
It is an arithmetic number, because the mean of its divisors is an integer number (5106002116006).
Almost surely, 210212004232011 is an apocalyptic number.
10212004232011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10212004232011 is an equidigital number, since it uses as much as digits as its factorization.
10212004232011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 192, while the sum is 19.
Adding to 10212004232011 its reverse (11023240021201), we get a palindrome (21235244253212).
The spelling of 10212004232011 in words is "ten trillion, two hundred twelve billion, four million, two hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •