Base | Representation |
---|---|
bin | 110100010011011000001110… |
… | …011001111001111010110101 |
3 | 1010011110122220011222212221112 |
4 | 310103120032121321322311 |
5 | 220122303121112023104 |
6 | 2133122211422324405 |
7 | 66311061214516541 |
oct | 6423301631717265 |
9 | 1104418804885845 |
10 | 230030100111029 |
11 | 67327243705319 |
12 | 2197145b129705 |
13 | 9b4798c7453ca |
14 | 40b3732838a21 |
15 | 1b8d92666986e |
hex | d1360e679eb5 |
230030100111029 has 2 divisors, whose sum is σ = 230030100111030. Its totient is φ = 230030100111028.
The previous prime is 230030100110989. The next prime is 230030100111127. The reversal of 230030100111029 is 920111001030032.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 152436111636004 + 77593988475025 = 12346502^2 + 8808745^2 .
It is a cyclic number.
It is not a de Polignac number, because 230030100111029 - 240 = 228930588483253 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 230030100110995 and 230030100111013.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (230030100111629) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 115015050055514 + 115015050055515.
It is an arithmetic number, because the mean of its divisors is an integer number (115015050055515).
Almost surely, 2230030100111029 is an apocalyptic number.
It is an amenable number.
230030100111029 is a deficient number, since it is larger than the sum of its proper divisors (1).
230030100111029 is an equidigital number, since it uses as much as digits as its factorization.
230030100111029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 324, while the sum is 23.
The spelling of 230030100111029 in words is "two hundred thirty trillion, thirty billion, one hundred million, one hundred eleven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •