Base | Representation |
---|---|
bin | 10110111101110000100110… |
… | …101100011010100010110001 |
3 | 111020121121111022210022222121 |
4 | 112331300212230122202301 |
5 | 101214300223112010001 |
6 | 554451133112234241 |
7 | 30163042262523130 |
oct | 2675604654324261 |
9 | 436547438708877 |
10 | 101001100110001 |
11 | 2a200364a11a93 |
12 | b3b283409b981 |
13 | 4448494300540 |
14 | 1ad269d3c5917 |
15 | ba240c8de6a1 |
hex | 5bdc26b1a8b1 |
101001100110001 has 16 divisors (see below), whose sum is σ = 124309798125184. Its totient is φ = 79912475005824.
The previous prime is 101001100109983. The next prime is 101001100110007. The reversal of 101001100110001 is 100011001100101.
It is a happy number.
It is a cyclic number.
It is not a de Polignac number, because 101001100110001 - 219 = 101001099585713 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 (101001100110007) 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, 12164461 + ... + 18707653.
It is an arithmetic number, because the mean of its divisors is an integer number (7769362382824).
Almost surely, 2101001100110001 is an apocalyptic number.
It is an amenable number.
101001100110001 is a deficient number, since it is larger than the sum of its proper divisors (23308698015183).
101001100110001 is a wasteful number, since it uses less digits than its factorization.
101001100110001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6712840.
The product of its (nonzero) digits is 1, while the sum is 7.
Adding to 101001100110001 its reverse (100011001100101), we get a palindrome (201012101210102).
It can be divided in two parts, 101001100 and 110001, that added together give a palindrome (101111101).
The spelling of 101001100110001 in words is "one hundred one trillion, one billion, one hundred million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •