Base | Representation |
---|---|
bin | 10110111101110000110011… |
… | …010101111001011100111101 |
3 | 111020121122001010002021011121 |
4 | 112331300303111321130331 |
5 | 101214301141422423401 |
6 | 554451210132350541 |
7 | 30163050450305206 |
oct | 2675606325713475 |
9 | 436548033067147 |
10 | 101001312311101 |
11 | 2a2004637788a4 |
12 | b3b2893175451 |
13 | 44484c926a217 |
14 | 1ad26bd6625ad |
15 | ba2421358ca1 |
hex | 5bdc3357973d |
101001312311101 has 16 divisors (see below), whose sum is σ = 101552164471296. Its totient is φ = 100451752424496.
The previous prime is 101001312311093. The next prime is 101001312311117. The reversal of 101001312311101 is 101113213100101.
It is a cyclic number.
It is not a de Polignac number, because 101001312311101 - 23 = 101001312311093 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101001312311161) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2652117406 + ... + 2652155488.
It is an arithmetic number, because the mean of its divisors is an integer number (6347010279456).
Almost surely, 2101001312311101 is an apocalyptic number.
It is an amenable number.
101001312311101 is a deficient number, since it is larger than the sum of its proper divisors (550852160195).
101001312311101 is a wasteful number, since it uses less digits than its factorization.
101001312311101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 54672.
The product of its (nonzero) digits is 18, while the sum is 16.
Adding to 101001312311101 its reverse (101113213100101), we get a palindrome (202114525411202).
The spelling of 101001312311101 in words is "one hundred one trillion, one billion, three hundred twelve million, three hundred eleven thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •