Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …000101101110001010011001 |
3 | 111020121111220122010010020121 |
4 | 112331233223011232022121 |
5 | 101214241201112023001 |
6 | 554450445550553241 |
7 | 30163005430625140 |
oct | 2675575305561231 |
9 | 436544818103217 |
10 | 101000100111001 |
11 | 2a1aa9a1499a33 |
12 | b3b25b5208821 |
13 | 4448365093960 |
14 | 1ad2606678757 |
15 | ba239ec0d6a1 |
hex | 5bdbeb16e299 |
101000100111001 has 16 divisors (see below), whose sum is σ = 125202116368000. Its totient is φ = 79337259433728.
The previous prime is 101000100110993. The next prime is 101000100111047. The reversal of 101000100111001 is 100111001000101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101000100111001 - 23 = 101000100110993 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (7).
It is not an unprimeable number, because it can be changed into a prime (101000101111001) 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, 3992401776 + ... + 3992427073.
It is an arithmetic number, because the mean of its divisors is an integer number (7825132273000).
Almost surely, 2101000100111001 is an apocalyptic number.
It is an amenable number.
101000100111001 is a deficient number, since it is larger than the sum of its proper divisors (24202016256999).
101000100111001 is a wasteful number, since it uses less digits than its factorization.
101000100111001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 7984829008.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101000100111001 its reverse (100111001000101), we get a palindrome (201111101111102).
It can be divided in two parts, 101000100 and 111001, that added together give a palindrome (101111101).
The spelling of 101000100111001 in words is "one hundred one trillion, one hundred million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •