Base | Representation |
---|---|
bin | 1001001000100010001001… |
… | …1111001111011010111111 |
3 | 1022120000201000211210210022 |
4 | 2102020202133033122333 |
5 | 2304012422302344043 |
6 | 33205154550002355 |
7 | 2054345243621651 |
oct | 222104237173277 |
9 | 38500630753708 |
10 | 10042212153023 |
11 | 3221972a623a6 |
12 | 11622b86463bb |
13 | 57ac90605c6b |
14 | 26a08d41c6d1 |
15 | 12634ac47868 |
hex | 922227cf6bf |
10042212153023 has 2 divisors, whose sum is σ = 10042212153024. Its totient is φ = 10042212153022.
The previous prime is 10042212152977. The next prime is 10042212153049. The reversal of 10042212153023 is 32035121224001.
It is an a-pointer prime, because the next prime (10042212153049) can be obtained adding 10042212153023 to its sum of digits (26).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10042212153023 - 210 = 10042212151999 is a prime.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 10042212152983 and 10042212153001.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10042212153823) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5021106076511 + 5021106076512.
It is an arithmetic number, because the mean of its divisors is an integer number (5021106076512).
Almost surely, 210042212153023 is an apocalyptic number.
10042212153023 is a deficient number, since it is larger than the sum of its proper divisors (1).
10042212153023 is an equidigital number, since it uses as much as digits as its factorization.
10042212153023 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 2880, while the sum is 26.
Adding to 10042212153023 its reverse (32035121224001), we get a palindrome (42077333377024).
The spelling of 10042212153023 in words is "ten trillion, forty-two billion, two hundred twelve million, one hundred fifty-three thousand, twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •