Base | Representation |
---|---|
bin | 100001111011111100001… |
… | …110111001111100100101 |
3 | 22020221120100012002200012 |
4 | 201323330032321330211 |
5 | 301202122113241404 |
6 | 4543204231100005 |
7 | 330326466161345 |
oct | 41737416717445 |
9 | 8227510162605 |
10 | 2332104040229 |
11 | 81a048a29737 |
12 | 317b88b11605 |
13 | 13bbbb62bb92 |
14 | 80c35658d25 |
15 | 409e3d79a6e |
hex | 21efc3b9f25 |
2332104040229 has 2 divisors, whose sum is σ = 2332104040230. Its totient is φ = 2332104040228.
The previous prime is 2332104040181. The next prime is 2332104040261. The reversal of 2332104040229 is 9220404012332.
It is an a-pointer prime, because the next prime (2332104040261) can be obtained adding 2332104040229 to its sum of digits (32).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2247594643204 + 84509397025 = 1499198^2 + 290705^2 .
It is a cyclic number.
It is not a de Polignac number, because 2332104040229 - 212 = 2332104036133 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2332104040195 and 2332104040204.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2332104048229) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1166052020114 + 1166052020115.
It is an arithmetic number, because the mean of its divisors is an integer number (1166052020115).
Almost surely, 22332104040229 is an apocalyptic number.
It is an amenable number.
2332104040229 is a deficient number, since it is larger than the sum of its proper divisors (1).
2332104040229 is an equidigital number, since it uses as much as digits as its factorization.
2332104040229 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 20736, while the sum is 32.
The spelling of 2332104040229 in words is "two trillion, three hundred thirty-two billion, one hundred four million, forty thousand, two hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •