Base | Representation |
---|---|
bin | 1001000110101010001010… |
… | …0100001101001110000000 |
3 | 1022102221120012020212001012 |
4 | 2101222202210031032000 |
5 | 2303000440301400000 |
6 | 33142310413300052 |
7 | 2052125106214634 |
oct | 221524244151600 |
9 | 38387505225035 |
10 | 10010001200000 |
11 | 320a24379866a |
12 | 1158009194628 |
13 | 577c29175c49 |
14 | 2686b54c4dc4 |
15 | 1255b2e8b735 |
hex | 91aa290d380 |
10010001200000 has 384 divisors, whose sum is σ = 26439289652160. Its totient is φ = 3761704960000.
The previous prime is 10010001199997. The next prime is 10010001200021. The reversal of 10010001200000 is 210001001.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (5).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 5419599077 + ... + 5419600923.
Almost surely, 210010001200000 is an apocalyptic number.
10010001200000 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 10010001200000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (13219644826080).
10010001200000 is an abundant number, since it is smaller than the sum of its proper divisors (16429288452160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10010001200000 is an frugal number, since it uses more digits than its factorization.
10010001200000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2700 (or 2668 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 5.
Adding to 10010001200000 its reverse (210001001), we get a palindrome (10010211201001).
The spelling of 10010001200000 in words is "ten trillion, ten billion, one million, two hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •