Base | Representation |
---|---|
bin | 1001000110001101001001… |
… | …0010111001001000000011 |
3 | 1022102012110100120011200112 |
4 | 2101203102102321020003 |
5 | 2302334012240024102 |
6 | 33134541444341535 |
7 | 2051431065331214 |
oct | 221432222711003 |
9 | 38365410504615 |
10 | 10002212033027 |
11 | 3206a06a32195 |
12 | 11565b46a48ab |
13 | 577287510bc6 |
14 | 268176c1d40b |
15 | 1252a923a252 |
hex | 918d24b9203 |
10002212033027 has 2 divisors, whose sum is σ = 10002212033028. Its totient is φ = 10002212033026.
The previous prime is 10002212032979. The next prime is 10002212033071. The reversal of 10002212033027 is 72033021220001.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10002212033027 - 222 = 10002207838723 is a prime.
It is a super-2 number, since 2×100022120330272 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10002212032993 and 10002212033011.
It is not a weakly prime, because it can be changed into another prime (10002212033327) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5001106016513 + 5001106016514.
It is an arithmetic number, because the mean of its divisors is an integer number (5001106016514).
Almost surely, 210002212033027 is an apocalyptic number.
10002212033027 is a deficient number, since it is larger than the sum of its proper divisors (1).
10002212033027 is an equidigital number, since it uses as much as digits as its factorization.
10002212033027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1008, while the sum is 23.
Adding to 10002212033027 its reverse (72033021220001), we get a palindrome (82035233253028).
The spelling of 10002212033027 in words is "ten trillion, two billion, two hundred twelve million, thirty-three thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.094 sec. • engine limits •