Base | Representation |
---|---|
bin | 10001011101100110010… |
… | …010111100111111001000 |
3 | 11020201102220111212111122 |
4 | 101131212102330333020 |
5 | 124130111100320013 |
6 | 2315140012214412 |
7 | 152461263502232 |
oct | 21354622747710 |
9 | 4221386455448 |
10 | 1200012120008 |
11 | 422a16615029 |
12 | 1746a176a408 |
13 | 89211c6c500 |
14 | 4211bda1252 |
15 | 21335cd1a08 |
hex | 117664bcfc8 |
1200012120008 has 96 divisors (see below), whose sum is σ = 2568864988800. Its totient is φ = 523838824704.
The previous prime is 1200012120001. The next prime is 1200012120017. The reversal of 1200012120008 is 8000212100021.
It is a happy number.
It is not an unprimeable number, because it can be changed into a prime (1200012120001) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15708641 + ... + 15784847.
It is an arithmetic number, because the mean of its divisors is an integer number (26759010300).
Almost surely, 21200012120008 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1200012120008, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1284432494400).
1200012120008 is an abundant number, since it is smaller than the sum of its proper divisors (1368852868792).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200012120008 is a wasteful number, since it uses less digits than its factorization.
1200012120008 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 76871 (or 76854 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 1200012120008 its reverse (8000212100021), we get a palindrome (9200224220029).
The spelling of 1200012120008 in words is "one trillion, two hundred billion, twelve million, one hundred twenty thousand, eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •