Base | Representation |
---|---|
bin | 1010111010011111110111… |
… | …0100110000001011101100 |
3 | 1120111012100202020110010220 |
4 | 2232213331310300023230 |
5 | 3033102202120402340 |
6 | 41304434254531340 |
7 | 2345656501023642 |
oct | 256477564601354 |
9 | 46435322213126 |
10 | 12000102122220 |
11 | 390723a895833 |
12 | 1419849b06b50 |
13 | 6907b28c7334 |
14 | 2d6b453a3192 |
15 | 15c23bd93ed0 |
hex | ae9fdd302ec |
12000102122220 has 96 divisors (see below), whose sum is σ = 33795573547008. Its totient is φ = 3181466356992.
The previous prime is 12000102122207. The next prime is 12000102122251. The reversal of 12000102122220 is 2222120100021.
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 12000102122220.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 9536277 + ... + 10721043.
It is an arithmetic number, because the mean of its divisors is an integer number (352037224448).
Almost surely, 212000102122220 is an apocalyptic number.
12000102122220 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12000102122220 is an abundant number, since it is smaller than the sum of its proper divisors (21795471424788).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12000102122220 is a wasteful number, since it uses less digits than its factorization.
12000102122220 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1185759 (or 1185757 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12000102122220 its reverse (2222120100021), we get a palindrome (14222222222241).
The spelling of 12000102122220 in words is "twelve trillion, one hundred two million, one hundred twenty-two thousand, two hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •