Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …101111101011101101011001 |
3 | 111020121111221101210222102000 |
4 | 112331233223233223231121 |
5 | 101214241211421023001 |
6 | 554450451022431213 |
7 | 30163005623261124 |
oct | 2675575357535531 |
9 | 436544841728360 |
10 | 101000111111001 |
11 | 2a1aa9a7722443 |
12 | b3b25b8a32509 |
13 | 444836744572b |
14 | 1ad2607cdd3bb |
15 | ba23a0b82a86 |
hex | 5bdbebbebb59 |
101000111111001 has 16 divisors (see below), whose sum is σ = 150255860332800. Its totient is φ = 67051677664944.
The previous prime is 101000111110991. The next prime is 101000111111021. The reversal of 101000111111001 is 100111111000101.
It is not a de Polignac number, because 101000111111001 - 29 = 101000111110489 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is not an unprimeable number, because it can be changed into a prime (101000111111021) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 7825819606 + ... + 7825832511.
It is an arithmetic number, because the mean of its divisors is an integer number (9390991270800).
Almost surely, 2101000111111001 is an apocalyptic number.
It is an amenable number.
101000111111001 is a deficient number, since it is larger than the sum of its proper divisors (49255749221799).
101000111111001 is a wasteful number, since it uses less digits than its factorization.
101000111111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15651652365 (or 15651652359 counting only the distinct ones).
The product of its (nonzero) digits is 1, while the sum is 9.
Adding to 101000111111001 its reverse (100111111000101), we get a palindrome (201111222111102).
The spelling of 101000111111001 in words is "one hundred one trillion, one hundred eleven million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •