Base | Representation |
---|---|
bin | 100001011110001000110… |
… | …000111011101101100101 |
3 | 22010212222001202122121122 |
4 | 201132020300323231211 |
5 | 300141102110012404 |
6 | 4520352521023325 |
7 | 325114446455441 |
oct | 41361060735545 |
9 | 8125861678548 |
10 | 2300102032229 |
11 | 8075166a7441 |
12 | 311937624b45 |
13 | 138b8b568781 |
14 | 7d47b391821 |
15 | 3ec6e5e33be |
hex | 21788c3bb65 |
2300102032229 has 2 divisors, whose sum is σ = 2300102032230. Its totient is φ = 2300102032228.
The previous prime is 2300102032211. The next prime is 2300102032237. The reversal of 2300102032229 is 9222302010032.
2300102032229 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2109181099204 + 190920933025 = 1452302^2 + 436945^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2300102032229 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2300102032198 and 2300102032207.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2300102032729) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1150051016114 + 1150051016115.
It is an arithmetic number, because the mean of its divisors is an integer number (1150051016115).
Almost surely, 22300102032229 is an apocalyptic number.
It is an amenable number.
2300102032229 is a deficient number, since it is larger than the sum of its proper divisors (1).
2300102032229 is an equidigital number, since it uses as much as digits as its factorization.
2300102032229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 26.
The spelling of 2300102032229 in words is "two trillion, three hundred billion, one hundred two million, thirty-two thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •