Base | Representation |
---|---|
bin | 10001011101100101100… |
… | …100110010111000101010 |
3 | 11020201102001202010102120 |
4 | 101131211210302320222 |
5 | 124130100001120020 |
6 | 2315134501012110 |
7 | 152461055605251 |
oct | 21354544627052 |
9 | 4221361663376 |
10 | 1200000020010 |
11 | 422a0a800130 |
12 | 1746996b4036 |
13 | 8920c5c3b4c |
14 | 4211a531798 |
15 | 21334be1740 |
hex | 11765932e2a |
1200000020010 has 256 divisors, whose sum is σ = 3370367232000. Its totient is φ = 270352235520.
The previous prime is 1200000020003. The next prime is 1200000020059. The reversal of 1200000020010 is 100200000021.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (6).
It is an unprimeable number.
It is a polite number, since it can be written in 127 ways as a sum of consecutive naturals, for example, 188291184 + ... + 188297556.
It is an arithmetic number, because the mean of its divisors is an integer number (13165497000).
Almost surely, 21200000020010 is an apocalyptic number.
1200000020010 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 1200000020010, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1685183616000).
1200000020010 is an abundant number, since it is smaller than the sum of its proper divisors (2170367211990).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1200000020010 is a wasteful number, since it uses less digits than its factorization.
1200000020010 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6981.
The product of its (nonzero) digits is 4, while the sum is 6.
Adding to 1200000020010 its reverse (100200000021), we get a palindrome (1300200020031).
The spelling of 1200000020010 in words is "one trillion, two hundred billion, twenty thousand, ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •