Base | Representation |
---|---|
bin | 1010111011101010101111… |
… | …0000100010011010010000 |
3 | 1120120010020102011121211010 |
4 | 2232322223300202122100 |
5 | 3033414332212401000 |
6 | 41322000444450520 |
7 | 2350300523142330 |
oct | 256725360423220 |
9 | 46503212147733 |
10 | 12020200122000 |
11 | 391481366a504 |
12 | 1421718849a40 |
13 | 6926666951b5 |
14 | 2d7ad06b90c0 |
15 | 15ca1651bd50 |
hex | aeeabc22690 |
12020200122000 has 320 divisors, whose sum is σ = 44452757127168. Its totient is φ = 2737333440000.
The previous prime is 12020200121999. The next prime is 12020200122013. The reversal of 12020200122000 is 22100202021.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 10853965 + ... + 11910035.
Almost surely, 212020200122000 is an apocalyptic number.
12020200122000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 12020200122000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (22226378563584).
12020200122000 is an abundant number, since it is smaller than the sum of its proper divisors (32432557005168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12020200122000 is a wasteful number, since it uses less digits than its factorization.
12020200122000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1056375 (or 1056359 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 12.
Adding to 12020200122000 its reverse (22100202021), we get a palindrome (12042300324021).
The spelling of 12020200122000 in words is "twelve trillion, twenty billion, two hundred million, one hundred twenty-two thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •