| Base | Representation |
|---|---|
| bin | 1001000110001000101010… |
| … | …1101101111000001110000 |
| 3 | 1022102002100122210221222220 |
| 4 | 2101202022231233001300 |
| 5 | 2302324032321010000 |
| 6 | 33134222344401040 |
| 7 | 2051356243550001 |
| oct | 221421255570160 |
| 9 | 38362318727886 |
| 10 | 10001011110000 |
| 11 | 3206450055a19 |
| 12 | 115631a476180 |
| 13 | 577125785571 |
| 14 | 2680a152d1a8 |
| 15 | 125238abb1a0 |
| hex | 9188ab6f070 |
10001011110000 has 400 divisors, whose sum is σ = 33706453482240. Its totient is φ = 2549606400000.
The previous prime is 10001011109987. The next prime is 10001011110007. The reversal of 10001011110000 is 1111010001.
It is a tau number, because it is divible by the number of its divisors (400).
It is a Harshad number since it is a multiple of its sum of digits (6).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10001011110007) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 79 ways as a sum of consecutive naturals, for example, 2083107600 + ... + 2083112400.
Almost surely, 210001011110000 is an apocalyptic number.
10001011110000 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 10001011110000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (16853226741120).
10001011110000 is an abundant number, since it is smaller than the sum of its proper divisors (23705442372240).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001011110000 is a wasteful number, since it uses less digits than its factorization.
10001011110000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7874 (or 7853 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10001011110000 its reverse (1111010001), we get a palindrome (10002122120001).
Subtracting from 10001011110000 its reverse (1111010001), we obtain a palindrome (9999900099999).
The spelling of 10001011110000 in words is "ten trillion, one billion, eleven million, one hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •