Base | Representation |
---|---|
bin | 11011110000110101011110… |
… | …011110100100100001101100 |
3 | 121000022221201200001220022111 |
4 | 123300311132132210201230 |
5 | 112001014333321031340 |
6 | 1111405235045253404 |
7 | 34501444244054110 |
oct | 3360653636444154 |
9 | 530287650056274 |
10 | 122103210330220 |
11 | 359a6754009769 |
12 | 11840506104264 |
13 | 531938b618252 |
14 | 2221b81097740 |
15 | e1b2b860baea |
hex | 6f0d5e7a486c |
122103210330220 has 48 divisors (see below), whose sum is σ = 293050488709440. Its totient is φ = 41863560125184.
The previous prime is 122103210330139. The next prime is 122103210330263. The reversal of 122103210330220 is 22033012301221.
It is a junction number, because it is equal to n+sod(n) for n = 122103210330191 and 122103210330200.
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, 10839766 + ... + 19018594.
It is an arithmetic number, because the mean of its divisors is an integer number (6105218514780).
Almost surely, 2122103210330220 is an apocalyptic number.
122103210330220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
122103210330220 is an abundant number, since it is smaller than the sum of its proper divisors (170947278379220).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
122103210330220 is a wasteful number, since it uses less digits than its factorization.
122103210330220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8285482 (or 8285480 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 122103210330220 its reverse (22033012301221), we get a palindrome (144136222631441).
The spelling of 122103210330220 in words is "one hundred twenty-two trillion, one hundred three billion, two hundred ten million, three hundred thirty thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •