Base | Representation |
---|---|
bin | 11101100101100100001… |
… | …010011110110000011111 |
3 | 21012101001012111121010212 |
4 | 131211210022132300133 |
5 | 231302443200000111 |
6 | 4154012244123035 |
7 | 266615406564044 |
oct | 35454412366037 |
9 | 7171035447125 |
10 | 2033200000031 |
11 | 714303438242 |
12 | 28a06a69647b |
13 | 119964897cc5 |
14 | 7059bcc31cb |
15 | 37d4ca0498b |
hex | 1d96429ec1f |
2033200000031 has 2 divisors, whose sum is σ = 2033200000032. Its totient is φ = 2033200000030.
The previous prime is 2033199999967. The next prime is 2033200000103. The reversal of 2033200000031 is 1300000023302.
Together with next prime (2033200000103) it forms an Ormiston pair, because they use the same digits, order apart.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 2033200000031 - 26 = 2033199999967 is a prime.
It is a super-2 number, since 2×20332000000312 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2033199999961 and 2033200000015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2033200080031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1016600000015 + 1016600000016.
It is an arithmetic number, because the mean of its divisors is an integer number (1016600000016).
Almost surely, 22033200000031 is an apocalyptic number.
2033200000031 is a deficient number, since it is larger than the sum of its proper divisors (1).
2033200000031 is an equidigital number, since it uses as much as digits as its factorization.
2033200000031 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 108, while the sum is 14.
Adding to 2033200000031 its reverse (1300000023302), we get a palindrome (3333200023333).
The spelling of 2033200000031 in words is "two trillion, thirty-three billion, two hundred million, thirty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •