Base | Representation |
---|---|
bin | 11011101111010101100010… |
… | …100101011011010000001000 |
3 | 120222222002211201000000010201 |
4 | 123233111202211123100020 |
5 | 111442322402201133000 |
6 | 1111250041305021544 |
7 | 34461136454634640 |
oct | 3357254245332010 |
9 | 528862751000121 |
10 | 122000200021000 |
11 | 35966aa3411804 |
12 | 118245581848b4 |
13 | 530c753254a62 |
14 | 221abac309520 |
15 | e18789e9396a |
hex | 6ef56295b408 |
122000200021000 has 256 divisors, whose sum is σ = 355277752128000. Its totient is φ = 38260678579200.
The previous prime is 122000200020997. The next prime is 122000200021121. The reversal of 122000200021000 is 120002000221.
It is a Harshad number since it is a multiple of its sum of digits (10).
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 63 ways as a sum of consecutive naturals, for example, 11958427 + ... + 19672426.
It is an arithmetic number, because the mean of its divisors is an integer number (1387803719250).
Almost surely, 2122000200021000 is an apocalyptic number.
122000200021000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122000200021000 is an abundant number, since it is smaller than the sum of its proper divisors (233277552107000).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122000200021000 is a wasteful number, since it uses less digits than its factorization.
122000200021000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31630929 (or 31630915 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 122000200021000 its reverse (120002000221), we get a palindrome (122120202021221).
The spelling of 122000200021000 in words is "one hundred twenty-two trillion, two hundred million, twenty-one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •