Base | Representation |
---|---|
bin | 1010111010011111111100… |
… | …0000100111111001010100 |
3 | 1120111012102010122220201112 |
4 | 2232213333000213321110 |
5 | 3033102222213324340 |
6 | 41304440245114152 |
7 | 2345660132051240 |
oct | 256477700477124 |
9 | 46435363586645 |
10 | 12000122011220 |
11 | 390725003a722 |
12 | 14198546b8958 |
13 | 6907b6a6c085 |
14 | 2d6b47c9d420 |
15 | 15c23d9c2065 |
hex | ae9ff027e54 |
12000122011220 has 72 divisors (see below), whose sum is σ = 29088270984192. Its totient is φ = 4073591145600.
The previous prime is 12000122011201. The next prime is 12000122011223. The reversal of 12000122011220 is 2211022100021.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a junction number, because it is equal to n+sod(n) for n = 12000122011195 and 12000122011204.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12000122011223) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2773172 + ... + 5629451.
Almost surely, 212000122011220 is an apocalyptic number.
12000122011220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12000122011220 is an abundant number, since it is smaller than the sum of its proper divisors (17088148972972).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000122011220 is a wasteful number, since it uses less digits than its factorization.
12000122011220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8402841 (or 8402738 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 12000122011220 its reverse (2211022100021), we get a palindrome (14211144111241).
The spelling of 12000122011220 in words is "twelve trillion, one hundred twenty-two million, eleven thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •