Base | Representation |
---|---|
bin | 10110111101110000100111… |
… | …010010001010100011110001 |
3 | 111020121121112000102002202010 |
4 | 112331300213102022203301 |
5 | 101214300233130143001 |
6 | 554451134104313133 |
7 | 30163042442610342 |
oct | 2675604722124361 |
9 | 436547460362663 |
10 | 101001110006001 |
11 | 2a20036a560aa7 |
12 | b3b28374727a9 |
13 | 444849638696a |
14 | 1ad26a08400c9 |
15 | ba240d6e68d6 |
hex | 5bdc2748a8f1 |
101001110006001 has 8 divisors (see below), whose sum is σ = 134668573535680. Its totient is φ = 67333859906832.
The previous prime is 101001110005979. The next prime is 101001110006099. The reversal of 101001110006001 is 100600011100101.
101001110006001 is digitally balanced in base 4, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 101001110006001 - 26 = 101001110005937 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (101001110506001) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 52250146 + ... + 54148683.
It is an arithmetic number, because the mean of its divisors is an integer number (16833571691960).
Almost surely, 2101001110006001 is an apocalyptic number.
It is an amenable number.
101001110006001 is a deficient number, since it is larger than the sum of its proper divisors (33667463529679).
101001110006001 is a wasteful number, since it uses less digits than its factorization.
101001110006001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 106715255.
The product of its (nonzero) digits is 6, while the sum is 12.
Adding to 101001110006001 its reverse (100600011100101), we get a palindrome (201601121106102).
The spelling of 101001110006001 in words is "one hundred one trillion, one billion, one hundred ten million, six thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •