Base | Representation |
---|---|
bin | 11001000011100111110110… |
… | …011110100011111011111010 |
3 | 112110012000202012220221202120 |
4 | 121003213312132203323322 |
5 | 103421004311421320442 |
6 | 1030213122051342110 |
7 | 32132460325132122 |
oct | 3103476636437372 |
9 | 473160665827676 |
10 | 110200111120122 |
11 | 321276718a8601 |
12 | 1043962a2b1936 |
13 | 4964a9762878a |
14 | 1d2d9dcaa9c82 |
15 | cb18577d64ec |
hex | 6439f67a3efa |
110200111120122 has 32 divisors (see below), whose sum is σ = 220658064382464. Its totient is φ = 36690402135600.
The previous prime is 110200111120111. The next prime is 110200111120123. The reversal of 110200111120122 is 221021111002011.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (110200111120123) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 81125097 + ... + 82472307.
It is an arithmetic number, because the mean of its divisors is an integer number (6895564511952).
Almost surely, 2110200111120122 is an apocalyptic number.
110200111120122 is an abundant number, since it is smaller than the sum of its proper divisors (110457953262342).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
110200111120122 is a wasteful number, since it uses less digits than its factorization.
110200111120122 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1363154.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 110200111120122 its reverse (221021111002011), we get a palindrome (331221222122133).
The spelling of 110200111120122 in words is "one hundred ten trillion, two hundred billion, one hundred eleven million, one hundred twenty thousand, one hundred twenty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.095 sec. • engine limits •