Base | Representation |
---|---|
bin | 100000011110110101011… |
… | …100001110101100001011 |
3 | 21220101112010100111012112 |
4 | 200132311130032230023 |
5 | 243032401304243143 |
6 | 4425232145332535 |
7 | 320160212552312 |
oct | 40366534165413 |
9 | 7811463314175 |
10 | 2232132102923 |
11 | 790707420548 |
12 | 30072863714b |
13 | 1326488966a8 |
14 | 7a070221279 |
15 | 3d0e2334e18 |
hex | 207b570eb0b |
2232132102923 has 2 divisors, whose sum is σ = 2232132102924. Its totient is φ = 2232132102922.
The previous prime is 2232132102917. The next prime is 2232132103007. The reversal of 2232132102923 is 3292012312322.
2232132102923 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2232132102923 - 214 = 2232132086539 is a prime.
It is a super-3 number, since 3×22321321029233 (a number of 38 digits) contains 333 as substring.
It is a Sophie Germain prime.
It is a self number, because there is not a number n which added to its sum of digits gives 2232132102923.
It is not a weakly prime, because it can be changed into another prime (2232132101923) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1116066051461 + 1116066051462.
It is an arithmetic number, because the mean of its divisors is an integer number (1116066051462).
Almost surely, 22232132102923 is an apocalyptic number.
2232132102923 is a deficient number, since it is larger than the sum of its proper divisors (1).
2232132102923 is an equidigital number, since it uses as much as digits as its factorization.
2232132102923 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15552, while the sum is 32.
The spelling of 2232132102923 in words is "two trillion, two hundred thirty-two billion, one hundred thirty-two million, one hundred two thousand, nine hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •