Base | Representation |
---|---|
bin | 1010111011101010010111… |
… | …0010111111010001100100 |
3 | 1120120002222102222001002210 |
4 | 2232322211302333101210 |
5 | 3033414131111214340 |
6 | 41321542513003420 |
7 | 2350265200032501 |
oct | 256724562772144 |
9 | 46502872861083 |
10 | 12020100101220 |
11 | 3914772164402 |
12 | 14216ab253570 |
13 | 69264ba450c3 |
14 | 2d7ac12c04a8 |
15 | 15ca0c861180 |
hex | aeea5cbf464 |
12020100101220 has 48 divisors (see below), whose sum is σ = 33672438233280. Its totient is φ = 3203821174656.
The previous prime is 12020100101213. The next prime is 12020100101237. The reversal of 12020100101220 is 2210100102021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 12020100101196 and 12020100101205.
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, 47963115 + ... + 48213074.
It is an arithmetic number, because the mean of its divisors is an integer number (701509129860).
Almost surely, 212020100101220 is an apocalyptic number.
12020100101220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12020100101220 is an abundant number, since it is smaller than the sum of its proper divisors (21652338132060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12020100101220 is a wasteful number, since it uses less digits than its factorization.
12020100101220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96178284 (or 96178282 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 12020100101220 its reverse (2210100102021), we get a palindrome (14230200203241).
The spelling of 12020100101220 in words is "twelve trillion, twenty billion, one hundred million, one hundred one thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •