Base | Representation |
---|---|
bin | 11011100010100011110110… |
… | …011000010101000100101110 |
3 | 120212212011121011100202211202 |
4 | 123202203312120111010232 |
5 | 111333431242044220420 |
6 | 1105334435320045502 |
7 | 34340535211053050 |
oct | 3342436630250456 |
9 | 525764534322752 |
10 | 121122211320110 |
11 | 35658706705800 |
12 | 11702367603892 |
13 | 5277a10a758c0 |
14 | 21ca4bc3a58d0 |
15 | e00a00078575 |
hex | 6e28f661512e |
121122211320110 has 384 divisors, whose sum is σ = 296840006394624. Its totient is φ = 34624972800000.
The previous prime is 121122211320109. The next prime is 121122211320133. The reversal of 121122211320110 is 11023112221121.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 191 ways as a sum of consecutive naturals, for example, 12233326160 + ... + 12233336060.
It is an arithmetic number, because the mean of its divisors is an integer number (773020849986).
Almost surely, 2121122211320110 is an apocalyptic number.
121122211320110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
121122211320110 is an abundant number, since it is smaller than the sum of its proper divisors (175717795074514).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
121122211320110 is a wasteful number, since it uses less digits than its factorization.
121122211320110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10652 (or 10641 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 20.
Adding to 121122211320110 its reverse (11023112221121), we get a palindrome (132145323541231).
The spelling of 121122211320110 in words is "one hundred twenty-one trillion, one hundred twenty-two billion, two hundred eleven million, three hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •