| Base | Representation |
|---|---|
| bin | 1001000110001000101010… |
| … | …1101010110101000110100 |
| 3 | 1022102002100122121212221220 |
| 4 | 2101202022231112220310 |
| 5 | 2302324032304310400 |
| 6 | 33134222342310340 |
| 7 | 2051356242652515 |
| oct | 221421255265064 |
| 9 | 38362318555856 |
| 10 | 10001011010100 |
| 11 | 320644aa97960 |
| 12 | 115631a4283b0 |
| 13 | 57712574bc56 |
| 14 | 2680a1504a0c |
| 15 | 125238a9b7a0 |
| hex | 9188ab56a34 |
10001011010100 has 288 divisors, whose sum is σ = 34134851229696. Its totient is φ = 2233319577600.
The previous prime is 10001011010077. The next prime is 10001011010101. The reversal of 10001011010100 is 101011010001.
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 (10001011010101) 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 95 ways as a sum of consecutive naturals, for example, 740199 + ... + 4533201.
It is an arithmetic number, because the mean of its divisors is an integer number (118523788992).
Almost surely, 210001011010100 is an apocalyptic number.
10001011010100 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 10001011010100, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (17067425614848).
10001011010100 is an abundant number, since it is smaller than the sum of its proper divisors (24133840219596).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
10001011010100 is a wasteful number, since it uses less digits than its factorization.
10001011010100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3793095 (or 3793088 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 10001011010100 its reverse (101011010001), we get a palindrome (10102022020101).
Subtracting from 10001011010100 its reverse (101011010001), we obtain a palindrome (9900000000099).
The spelling of 10001011010100 in words is "ten trillion, one billion, eleven million, ten thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •