Base | Representation |
---|---|
bin | 10010111100100101111… |
… | …110011000010001000000 |
3 | 11121110201110122210201002 |
4 | 102330211332120101000 |
5 | 132313010110400000 |
6 | 2434045224031132 |
7 | 163032035044601 |
oct | 22744576302100 |
9 | 4543643583632 |
10 | 1302012200000 |
11 | 4621a8a418a6 |
12 | 1904093024a8 |
13 | 95a18c53825 |
14 | 470368dbda8 |
15 | 23d058e78d5 |
hex | 12f25f98440 |
1302012200000 has 168 divisors, whose sum is σ = 3274914017088. Its totient is φ = 513464000000.
The previous prime is 1302012199949. The next prime is 1302012200023. The reversal of 1302012200000 is 22102031.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 14154155 + ... + 14245845.
It is an arithmetic number, because the mean of its divisors is an integer number (19493535816).
Almost surely, 21302012200000 is an apocalyptic number.
1302012200000 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 1302012200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1637457008544).
1302012200000 is an abundant number, since it is smaller than the sum of its proper divisors (1972901817088).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1302012200000 is an frugal number, since it uses more digits than its factorization.
1302012200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 91799 (or 91769 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 1302012200000 its reverse (22102031), we get a palindrome (1302034302031).
The spelling of 1302012200000 in words is "one trillion, three hundred two billion, twelve million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •