Base | Representation |
---|---|
bin | 1010111011001100111011… |
… | …1010111101011010100100 |
3 | 1120112100120212202111221120 |
4 | 2232303032322331122210 |
5 | 3033301441212401040 |
6 | 41314154545013540 |
7 | 2346565342232250 |
oct | 256631672753244 |
9 | 46470525674846 |
10 | 12012200122020 |
11 | 39113888a207a |
12 | 14200656242b0 |
13 | 6919901520b7 |
14 | 2d7572011260 |
15 | 15c6e90217d0 |
hex | aecceebd6a4 |
12012200122020 has 96 divisors (see below), whose sum is σ = 38835319289088. Its totient is φ = 2717340106752.
The previous prime is 12012200121997. The next prime is 12012200122037. The reversal of 12012200122020 is 2022100221021.
It is a Harshad number since it is a multiple of its sum of digits (15).
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, 147384397 + ... + 147465876.
It is an arithmetic number, because the mean of its divisors is an integer number (404534575928).
Almost surely, 212012200122020 is an apocalyptic number.
12012200122020 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12012200122020 is an abundant number, since it is smaller than the sum of its proper divisors (26823119167068).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12012200122020 is a wasteful number, since it uses less digits than its factorization.
12012200122020 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 294850389 (or 294850387 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 12012200122020 its reverse (2022100221021), we get a palindrome (14034300343041).
Subtracting from 12012200122020 its reverse (2022100221021), we obtain a palindrome (9990099900999).
The spelling of 12012200122020 in words is "twelve trillion, twelve billion, two hundred million, one hundred twenty-two thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •