Base | Representation |
---|---|
bin | 1010111011110001110011… |
… | …1111111111110100000000 |
3 | 1120120022010211010102110222 |
4 | 2232330130333333310000 |
5 | 3033432230100000000 |
6 | 41322513153442212 |
7 | 2350365562633256 |
oct | 256743477776400 |
9 | 46508124112428 |
10 | 12022100000000 |
11 | 39155a9041a12 |
12 | 1421b68b70368 |
13 | 6928aa18536c |
14 | 2d7c30b505d6 |
15 | 15cac8203a85 |
hex | aef1cfffd00 |
12022100000000 has 324 divisors, whose sum is σ = 31306718345952. Its totient is φ = 4598880000000.
The previous prime is 12022099999981. The next prime is 12022100000011. The reversal of 12022100000000 is 122021.
It is a Harshad number since it is a multiple of its sum of digits (8).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2299997387 + ... + 2300002613.
Almost surely, 212022100000000 is an apocalyptic number.
12022100000000 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 12022100000000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (15653359172976).
12022100000000 is an abundant number, since it is smaller than the sum of its proper divisors (19284618345952).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
12022100000000 is an frugal number, since it uses more digits than its factorization.
12022100000000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5306 (or 5257 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 8.
Adding to 12022100000000 its reverse (122021), we get a palindrome (12022100122021).
The spelling of 12022100000000 in words is "twelve trillion, twenty-two billion, one hundred million", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •