Base | Representation |
---|---|
bin | 1001001110010110010100… |
… | …0011100010111001010001 |
3 | 1022220120120022022112020222 |
4 | 2103211211003202321101 |
5 | 2312132021440322113 |
6 | 33323120020242425 |
7 | 2064513006624413 |
oct | 223454503427121 |
9 | 38816508275228 |
10 | 10142113214033 |
11 | 3260278561139 |
12 | 1179739240415 |
13 | 587521783b08 |
14 | 270c492869b3 |
15 | 128c4643be08 |
hex | 939650e2e51 |
10142113214033 has 2 divisors, whose sum is σ = 10142113214034. Its totient is φ = 10142113214032.
The previous prime is 10142113213961. The next prime is 10142113214063. The reversal of 10142113214033 is 33041231124101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9071318730769 + 1070794483264 = 3011863^2 + 1034792^2 .
It is a cyclic number.
It is not a de Polignac number, because 10142113214033 - 28 = 10142113213777 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10142113213993 and 10142113214011.
It is not a weakly prime, because it can be changed into another prime (10142113214063) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5071056607016 + 5071056607017.
It is an arithmetic number, because the mean of its divisors is an integer number (5071056607017).
Almost surely, 210142113214033 is an apocalyptic number.
It is an amenable number.
10142113214033 is a deficient number, since it is larger than the sum of its proper divisors (1).
10142113214033 is an equidigital number, since it uses as much as digits as its factorization.
10142113214033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1728, while the sum is 26.
Adding to 10142113214033 its reverse (33041231124101), we get a palindrome (43183344338134).
The spelling of 10142113214033 in words is "ten trillion, one hundred forty-two billion, one hundred thirteen million, two hundred fourteen thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •