Base | Representation |
---|---|
bin | 10110111101111001110101… |
… | …111110001101100010110001 |
3 | 111020122120002200000112202000 |
4 | 112331321311332031202301 |
5 | 101214431032122010001 |
6 | 554455453320244213 |
7 | 30163543146242001 |
oct | 2675716576154261 |
9 | 436576080015660 |
10 | 101011020110001 |
11 | 2a2045955558a1 |
12 | b3b4742310669 |
13 | 44493b555a621 |
14 | 1ad2d60a82001 |
15 | ba27dd748a86 |
hex | 5bde75f8d8b1 |
101011020110001 has 32 divisors (see below), whose sum is σ = 158890020422400. Its totient is φ = 63202919028480.
The previous prime is 101011020109963. The next prime is 101011020110003. The reversal of 101011020110001 is 100011020110101.
It is not a de Polignac number, because 101011020110001 - 214 = 101011020093617 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 (101011020110003) 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 31 ways as a sum of consecutive naturals, for example, 306336030 + ... + 306665591.
It is an arithmetic number, because the mean of its divisors is an integer number (4965313138200).
Almost surely, 2101011020110001 is an apocalyptic number.
It is an amenable number.
101011020110001 is a deficient number, since it is larger than the sum of its proper divisors (57879000312399).
101011020110001 is a wasteful number, since it uses less digits than its factorization.
101011020110001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 613002006 (or 613002000 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 9.
Adding to 101011020110001 its reverse (100011020110101), we get a palindrome (201022040220102).
The spelling of 101011020110001 in words is "one hundred one trillion, eleven billion, twenty million, one hundred ten thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •