Base | Representation |
---|---|
bin | 11011101111011111101101… |
… | …011101110110010010100010 |
3 | 121000000011000201212112020020 |
4 | 123233133231131312102202 |
5 | 111443012233210032320 |
6 | 1111255045034054310 |
7 | 34462004203145565 |
oct | 3357375535662242 |
9 | 530004021775206 |
10 | 122011120002210 |
11 | 3597069746626a |
12 | 118266a527a396 |
13 | 53107a37135ba |
14 | 221b52670a4dc |
15 | e18bc89c8940 |
hex | 6ef7ed7764a2 |
122011120002210 has 32 divisors (see below), whose sum is σ = 296533354947840. Its totient is φ = 32124446784768.
The previous prime is 122011120002209. The next prime is 122011120002251. The reversal of 122011120002210 is 12200021110221.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 122011120002210.
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, 25740740247 + ... + 25740744986.
It is an arithmetic number, because the mean of its divisors is an integer number (9266667342120).
Almost surely, 2122011120002210 is an apocalyptic number.
122011120002210 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
122011120002210 is an abundant number, since it is smaller than the sum of its proper divisors (174522234945630).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122011120002210 is a wasteful number, since it uses less digits than its factorization.
122011120002210 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 51481485322.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 122011120002210 its reverse (12200021110221), we get a palindrome (134211141112431).
The spelling of 122011120002210 in words is "one hundred twenty-two trillion, eleven billion, one hundred twenty million, two thousand, two hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.121 sec. • engine limits •