Base | Representation |
---|---|
bin | 11011110000110100010110… |
… | …011001011000110111110010 |
3 | 121000022211121101112011212120 |
4 | 123300310112121120313302 |
5 | 112001004344224342320 |
6 | 1111404515045335110 |
7 | 34501402261036452 |
oct | 3360642631306762 |
9 | 530284541464776 |
10 | 122102001012210 |
11 | 359a619341919a |
12 | 11840229107496 |
13 | 5319227c1076b |
14 | 2221aa861dd62 |
15 | e1b247380440 |
hex | 6f0d16658df2 |
122102001012210 has 32 divisors (see below), whose sum is σ = 293045669467200. Its totient is φ = 32560437265728.
The previous prime is 122102001012181. The next prime is 122102001012223. The reversal of 122102001012210 is 12210100201221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 122102001012210.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4594216 + ... + 16288364.
It is an arithmetic number, because the mean of its divisors is an integer number (9157677170850).
Almost surely, 2122102001012210 is an apocalyptic number.
122102001012210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122102001012210 is an abundant number, since it is smaller than the sum of its proper divisors (170943668454990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122102001012210 is a wasteful number, since it uses less digits than its factorization.
122102001012210 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12042202.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122102001012210 its reverse (12210100201221), we get a palindrome (134312101213431).
The spelling of 122102001012210 in words is "one hundred twenty-two trillion, one hundred two billion, one million, twelve thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •