Base | Representation |
---|---|
bin | 1001000111011010100101… |
… | …1011101100101111100101 |
3 | 1022111012010012020222110022 |
4 | 2101312221123230233211 |
5 | 2303204101313442404 |
6 | 33152300411004525 |
7 | 2053065213310523 |
oct | 221665133545745 |
9 | 38435105228408 |
10 | 10023001312229 |
11 | 3214804a3a374 |
12 | 115a636a39745 |
13 | 57921b586a49 |
14 | 269189c7d313 |
15 | 125ac44118be |
hex | 91da96ecbe5 |
10023001312229 has 2 divisors, whose sum is σ = 10023001312230. Its totient is φ = 10023001312228.
The previous prime is 10023001312193. The next prime is 10023001312231. The reversal of 10023001312229 is 92221310032001.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8655275740225 + 1367725572004 = 2941985^2 + 1169498^2 .
It is a cyclic number.
It is not a de Polignac number, because 10023001312229 - 228 = 10022732876773 is a prime.
Together with 10023001312231, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 10023001312198 and 10023001312207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10023001312829) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5011500656114 + 5011500656115.
It is an arithmetic number, because the mean of its divisors is an integer number (5011500656115).
Almost surely, 210023001312229 is an apocalyptic number.
It is an amenable number.
10023001312229 is a deficient number, since it is larger than the sum of its proper divisors (1).
10023001312229 is an equidigital number, since it uses as much as digits as its factorization.
10023001312229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1296, while the sum is 26.
The spelling of 10023001312229 in words is "ten trillion, twenty-three billion, one million, three hundred twelve thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •