Base | Representation |
---|---|
bin | 11001000011100111101111… |
… | …111111001000111111111111 |
3 | 112110012000110122000020220212 |
4 | 121003213233333020333333 |
5 | 103421004101032020111 |
6 | 1030213103201303035 |
7 | 32132454533401133 |
oct | 3103475777107777 |
9 | 473160418006825 |
10 | 110200002220031 |
11 | 32127616388329 |
12 | 104395b9934a7b |
13 | 4964a7abb9c59 |
14 | 1d2d9cc43d3c3 |
15 | cb184ce7498b |
hex | 6439effc8fff |
110200002220031 has 2 divisors, whose sum is σ = 110200002220032. Its totient is φ = 110200002220030.
The previous prime is 110200002219997. The next prime is 110200002220067. The reversal of 110200002220031 is 130022200002011.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 110200002220031 - 222 = 110199998025727 is a prime.
It is a super-2 number, since 2×1102000022200312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 110200002219988 and 110200002220015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (110200002220081) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55100001110015 + 55100001110016.
It is an arithmetic number, because the mean of its divisors is an integer number (55100001110016).
Almost surely, 2110200002220031 is an apocalyptic number.
110200002220031 is a deficient number, since it is larger than the sum of its proper divisors (1).
110200002220031 is an equidigital number, since it uses as much as digits as its factorization.
110200002220031 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 48, while the sum is 14.
Adding to 110200002220031 its reverse (130022200002011), we get a palindrome (240222202222042).
The spelling of 110200002220031 in words is "one hundred ten trillion, two hundred billion, two million, two hundred twenty thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •