Base | Representation |
---|---|
bin | 11011110010100010010110… |
… | …111001011010111101011010 |
3 | 121000202010111101010210011220 |
4 | 123302202112321122331122 |
5 | 112004423301434310020 |
6 | 1111535052023032510 |
7 | 34513053351332052 |
oct | 3362422671327532 |
9 | 530663441123156 |
10 | 122220121010010 |
11 | 35a41298046891 |
12 | 1185b0b329b736 |
13 | 532740077669a |
14 | 22276b1dc6562 |
15 | e1e35c278240 |
hex | 6f2896e5af5a |
122220121010010 has 64 divisors (see below), whose sum is σ = 303030997032960. Its totient is φ = 31515623922240.
The previous prime is 122220121010003. The next prime is 122220121010047. The reversal of 122220121010010 is 10010121022221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 51021142 + ... + 53362881.
It is an arithmetic number, because the mean of its divisors is an integer number (4734859328640).
Almost surely, 2122220121010010 is an apocalyptic number.
122220121010010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122220121010010 is an abundant number, since it is smaller than the sum of its proper divisors (180810876022950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122220121010010 is a wasteful number, since it uses less digits than its factorization.
122220121010010 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 104385323.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122220121010010 its reverse (10010121022221), we get a palindrome (132230242032231).
The spelling of 122220121010010 in words is "one hundred twenty-two trillion, two hundred twenty billion, one hundred twenty-one million, ten thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •