Base | Representation |
---|---|
bin | 1010111011110001110100… |
… | …0000000100101100100000 |
3 | 1120120022010211011102220201 |
4 | 2232330131000010230200 |
5 | 3033432230101120000 |
6 | 41322513154114544 |
7 | 2350365563045500 |
oct | 256743500045440 |
9 | 46508124142821 |
10 | 12022100020000 |
11 | 39155a9055a44 |
12 | 1421b68b7ba54 |
13 | 6928aa1914b5 |
14 | 2d7c30b57a00 |
15 | 15cac820996a |
hex | aef1d004b20 |
12022100020000 has 180 divisors, whose sum is σ = 34404934513950. Its totient is φ = 4121862528000.
The previous prime is 12022100019991. The next prime is 12022100020001. The reversal of 12022100020000 is 2000122021.
It can be written as a sum of positive squares in 5 ways, for example, as 1190813467536 + 10831286552464 = 1091244^2 + 3291092^2 .
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (12022100020001) by changing a digit.
It is a polite number, since it can be written in 29 ways as a sum of consecutive naturals, for example, 5153725 + ... + 7113724.
Almost surely, 212022100020000 is an apocalyptic number.
12022100020000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12022100020000 is an abundant number, since it is smaller than the sum of its proper divisors (22382834493950).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022100020000 is an equidigital number, since it uses as much as digits as its factorization.
12022100020000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 12267493 (or 12267463 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 10.
Adding to 12022100020000 its reverse (2000122021), we get a palindrome (12024100142021).
The spelling of 12022100020000 in words is "twelve trillion, twenty-two billion, one hundred million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.426 sec. • engine limits •