Base | Representation |
---|---|
bin | 11011110000110100100011… |
… | …101001010110011010000110 |
3 | 121000022212011212210120201012 |
4 | 123300310203221112122012 |
5 | 112001010323131101410 |
6 | 1111404553110002222 |
7 | 34501410630332465 |
oct | 3360644351263206 |
9 | 530285155716635 |
10 | 122102223300230 |
11 | 359a62979444a8 |
12 | 1184028b646372 |
13 | 5319261c9c734 |
14 | 2221ac9d649dc |
15 | e1b25bb3d605 |
hex | 6f0d23a56686 |
122102223300230 has 16 divisors (see below), whose sum is σ = 219886084655424. Its totient is φ = 48818204272320.
The previous prime is 122102223300203. The next prime is 122102223300247. The reversal of 122102223300230 is 32003322201221.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 122102223300196 and 122102223300205.
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 7 ways as a sum of consecutive naturals, for example, 2835608366 + ... + 2835651425.
It is an arithmetic number, because the mean of its divisors is an integer number (13742880290964).
Almost surely, 2122102223300230 is an apocalyptic number.
122102223300230 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122102223300230 is a deficient number, since it is larger than the sum of its proper divisors (97783861355194).
122102223300230 is a wasteful number, since it uses less digits than its factorization.
122102223300230 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5671261951.
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 122102223300230 its reverse (32003322201221), we get a palindrome (154105545501451).
The spelling of 122102223300230 in words is "one hundred twenty-two trillion, one hundred two billion, two hundred twenty-three million, three hundred thousand, two hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •