Base | Representation |
---|---|
bin | 11100000010010010000001… |
… | …111111010110101000101100 |
3 | 121011120120021111021010002202 |
4 | 130002102001333112220230 |
5 | 112130140201103032340 |
6 | 1114124111554441032 |
7 | 34654166014120151 |
oct | 3402220177265054 |
9 | 534516244233082 |
10 | 123302102002220 |
11 | 363191451125a9 |
12 | 119b4934593178 |
13 | 53a54523c776b |
14 | 2263bd4316228 |
15 | e3c585d68c15 |
hex | 702481fd6a2c |
123302102002220 has 36 divisors (see below), whose sum is σ = 275061817178400. Its totient is φ = 46419614869248.
The previous prime is 123302102002213. The next prime is 123302102002267. The reversal of 123302102002220 is 22200201203321.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (20).
It is a junction number, because it is equal to n+sod(n) for n = 123302102002192 and 123302102002201.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 10666266020 + ... + 10666277579.
Almost surely, 2123302102002220 is an apocalyptic number.
123302102002220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
123302102002220 is an abundant number, since it is smaller than the sum of its proper divisors (151759715176180).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
123302102002220 is a wasteful number, since it uses less digits than its factorization.
123302102002220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 21332543642 (or 21332543623 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
Adding to 123302102002220 its reverse (22200201203321), we get a palindrome (145502303205541).
The spelling of 123302102002220 in words is "one hundred twenty-three trillion, three hundred two billion, one hundred two million, two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •