| Base | Representation |
|---|---|
| bin | 10110111101110000100111… |
| … | …010010001001010101101000 |
| 3 | 111020121121112000101211212220 |
| 4 | 112331300213102021111220 |
| 5 | 101214300233130013000 |
| 6 | 554451134104234040 |
| 7 | 30163042442556636 |
| oct | 2675604722112550 |
| 9 | 436547460354786 |
| 10 | 101001110001000 |
| 11 | 2a20036a558270 |
| 12 | b3b283746b920 |
| 13 | 44484963845c1 |
| 14 | 1ad26a083c356 |
| 15 | ba240d6e51a0 |
| hex | 5bdc27489568 |
101001110001000 has 256 divisors, whose sum is σ = 343809886417920. Its totient is φ = 24482351520000.
The previous prime is 101001110000993. The next prime is 101001110001149. The reversal of 101001110001000 is 100011100101.
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 self number, because there is not a number n which added to its sum of digits gives 101001110001000.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 299834667 + ... + 300171333.
It is an arithmetic number, because the mean of its divisors is an integer number (1343007368820).
Almost surely, 2101001110001000 is an apocalyptic number.
101001110001000 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 101001110001000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (171904943208960).
101001110001000 is an abundant number, since it is smaller than the sum of its proper divisors (242808776416920).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101001110001000 is a wasteful number, since it uses less digits than its factorization.
101001110001000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 345793 (or 345779 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101001110001000 its reverse (100011100101), we get a palindrome (101101121101101).
It can be divided in two parts, 1010011 and 10001000, that added together give a palindrome (11011011).
The spelling of 101001110001000 in words is "one hundred one trillion, one billion, one hundred ten million, one thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •