Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001011101011100110110101 |
3 | 111020121111122201122021100220 |
4 | 112331233211023223212311 |
5 | 101214241000224310401 |
6 | 554450432050524553 |
7 | 30163003115366214 |
oct | 2675574513534665 |
9 | 436544581567326 |
10 | 101000001010101 |
11 | 2a1aa950561a66 |
12 | b3b2587b96759 |
13 | 444834a6a647b |
14 | 1ad25d743d07b |
15 | ba2396185336 |
hex | 5bdbe52eb9b5 |
101000001010101 has 32 divisors (see below), whose sum is σ = 138573584663040. Its totient is φ = 65405243904000.
The previous prime is 101000001010087. The next prime is 101000001010127. The reversal of 101000001010101 is 101010100000101.
It is not a de Polignac number, because 101000001010101 - 227 = 100999866792373 is a prime.
101000001010101 is a modest number, since divided by 1010101 gives 1010000 as remainder.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 101000001010101.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000001010001) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 312523285 + ... + 312846293.
It is an arithmetic number, because the mean of its divisors is an integer number (4330424520720).
Almost surely, 2101000001010101 is an apocalyptic number.
It is an amenable number.
101000001010101 is a deficient number, since it is larger than the sum of its proper divisors (37573583652939).
101000001010101 is a wasteful number, since it uses less digits than its factorization.
101000001010101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 342637.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101000001010101 its reverse (101010100000101), we get a palindrome (202010101010202).
The spelling of 101000001010101 in words is "one hundred one trillion, one million, ten thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.113 sec. • engine limits •