Base | Representation |
---|---|
bin | 1001011001011001101111… |
… | …1010101110100011101101 |
3 | 1100120201201200210001201012 |
4 | 2112112123322232203231 |
5 | 2323234430111213123 |
6 | 33550243314555005 |
7 | 2114314615514315 |
oct | 226263372564355 |
9 | 40521650701635 |
10 | 10332012210413 |
11 | 33238665a0863 |
12 | 11aa4b5b98a65 |
13 | 59c3c61b026a |
14 | 27a101a32445 |
15 | 12db5cc01378 |
hex | 9659beae8ed |
10332012210413 has 2 divisors, whose sum is σ = 10332012210414. Its totient is φ = 10332012210412.
The previous prime is 10332012210407. The next prime is 10332012210449. The reversal of 10332012210413 is 31401221023301.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10142963779204 + 189048431209 = 3184802^2 + 434797^2 .
It is a cyclic number.
It is not a de Polignac number, because 10332012210413 - 240 = 9232500582637 is a prime.
It is a super-2 number, since 2×103320122104132 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10332012210313) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5166006105206 + 5166006105207.
It is an arithmetic number, because the mean of its divisors is an integer number (5166006105207).
Almost surely, 210332012210413 is an apocalyptic number.
It is an amenable number.
10332012210413 is a deficient number, since it is larger than the sum of its proper divisors (1).
10332012210413 is an equidigital number, since it uses as much as digits as its factorization.
10332012210413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 10332012210413 its reverse (31401221023301), we get a palindrome (41733233233714).
The spelling of 10332012210413 in words is "ten trillion, three hundred thirty-two billion, twelve million, two hundred ten thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •