Base | Representation |
---|---|
bin | 100000011110110100010… |
… | …000010011100110111111 |
3 | 21220101110201220022200221 |
4 | 200132310100103212333 |
5 | 243032331210401002 |
6 | 4425230155002211 |
7 | 320156551436545 |
oct | 40366420234677 |
9 | 7811421808627 |
10 | 2232112200127 |
11 | 7906a7167257 |
12 | 300721a39367 |
13 | 1326447185a4 |
14 | 7a06b71dd95 |
15 | 3d0e0702c37 |
hex | 207b44139bf |
2232112200127 has 2 divisors, whose sum is σ = 2232112200128. Its totient is φ = 2232112200126.
The previous prime is 2232112200113. The next prime is 2232112200163. The reversal of 2232112200127 is 7210022112322.
2232112200127 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 a de Polignac number, because none of the positive numbers 2k-2232112200127 is a prime.
It is a super-3 number, since 3×22321122001273 (a number of 38 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2232112200187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1116056100063 + 1116056100064.
It is an arithmetic number, because the mean of its divisors is an integer number (1116056100064).
Almost surely, 22232112200127 is an apocalyptic number.
2232112200127 is a deficient number, since it is larger than the sum of its proper divisors (1).
2232112200127 is an equidigital number, since it uses as much as digits as its factorization.
2232112200127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1344, while the sum is 25.
Adding to 2232112200127 its reverse (7210022112322), we get a palindrome (9442134312449).
The spelling of 2232112200127 in words is "two trillion, two hundred thirty-two billion, one hundred twelve million, two hundred thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •