Base | Representation |
---|---|
bin | 1010111011110001110100… |
… | …0100010001100010110000 |
3 | 1120120022010220020101110220 |
4 | 2232330131010101202300 |
5 | 3033432230341334300 |
6 | 41322513233453040 |
7 | 2350365605313132 |
oct | 256743504214260 |
9 | 46508126211426 |
10 | 12022101121200 |
11 | 39155a9738325 |
12 | 1421b69411180 |
13 | 6928aa4887b1 |
14 | 2d7c30d63052 |
15 | 15cac8375da0 |
hex | aef1d1118b0 |
12022101121200 has 60 divisors (see below), whose sum is σ = 38510797262088. Its totient is φ = 3205893632000.
The previous prime is 12022101121139. The next prime is 12022101121211. The reversal of 12022101121200 is 212110122021.
It is a tau number, because it is divible by the number of its divisors (60).
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 12022101121200.
It is an unprimeable number.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 5009207601 + ... + 5009210000.
Almost surely, 212022101121200 is an apocalyptic number.
12022101121200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
12022101121200 is an abundant number, since it is smaller than the sum of its proper divisors (26488696140888).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022101121200 is a wasteful number, since it uses less digits than its factorization.
12022101121200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10018417622 (or 10018417611 counting only the distinct ones).
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 12022101121200 its reverse (212110122021), we get a palindrome (12234211243221).
The spelling of 12022101121200 in words is "twelve trillion, twenty-two billion, one hundred one million, one hundred twenty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •