Base | Representation |
---|---|
bin | 11101000110101001011… |
… | …01000111100101010000 |
3 | 10112121011210022201221110 |
4 | 32203110231013211100 |
5 | 112341000224310000 |
6 | 2043221044053320 |
7 | 132150646223436 |
oct | 16432455074520 |
9 | 3477153281843 |
10 | 1000001010000 |
11 | 356109555803 |
12 | 141982394240 |
13 | 733b8560485 |
14 | 3658662ad56 |
15 | 1b02b8b5850 |
hex | e8d4b47950 |
1000001010000 has 200 divisors, whose sum is σ = 3247483022784. Its totient is φ = 265068800000.
The previous prime is 1000001009983. The next prime is 1000001010013. The reversal of 1000001010000 is 101000001.
It is a tau number, because it is divible by the number of its divisors (200).
It is a Harshad number since it is a multiple of its sum of digits (3).
It is a super Niven number, because it is divisible the sum of any subset of its (nonzero) digits.
1000001010000 is a modest number, since divided by 1010000 gives 10000 as remainder.
It is a congruent number.
It is an unprimeable number.
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 39 ways as a sum of consecutive naturals, for example, 4910200 + ... + 5109800.
Almost surely, 21000001010000 is an apocalyptic number.
1000001010000 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 1000001010000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1623741511392).
1000001010000 is an abundant number, since it is smaller than the sum of its proper divisors (2247482012784).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1000001010000 is a wasteful number, since it uses less digits than its factorization.
1000001010000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 199799 (or 199778 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 3.
Adding to 1000001010000 its reverse (101000001), we get a palindrome (1000102010001).
Subtracting from 1000001010000 its reverse (101000001), we obtain a palindrome (999900009999).
The spelling of 1000001010000 in words is "one trillion, one million, ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •