Base | Representation |
---|---|
bin | 10110111101101111101011… |
… | …000101010011000101101111 |
3 | 111020121111220121220111010120 |
4 | 112331233223011103011233 |
5 | 101214241201100000421 |
6 | 554450445544340023 |
7 | 30163005426653634 |
oct | 2675575305230557 |
9 | 436544817814116 |
10 | 101000100000111 |
11 | 2a1aa9a1423694 |
12 | b3b25b5174613 |
13 | 4448365055340 |
14 | 1ad260664a18b |
15 | ba239ebda8c6 |
hex | 5bdbeb15316f |
101000100000111 has 16 divisors (see below), whose sum is σ = 151331253513216. Its totient is φ = 59451563879136.
The previous prime is 101000100000103. The next prime is 101000100000113. The reversal of 101000100000111 is 111000001000101.
It is not a de Polignac number, because 101000100000111 - 23 = 101000100000103 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 101000100000111.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (101000100000113) 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, 56298828535 + ... + 56298830328.
It is an arithmetic number, because the mean of its divisors is an integer number (9458203344576).
Almost surely, 2101000100000111 is an apocalyptic number.
101000100000111 is a deficient number, since it is larger than the sum of its proper divisors (50331153513105).
101000100000111 is a wasteful number, since it uses less digits than its factorization.
101000100000111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112597658902.
The product of its (nonzero) digits is 1, while the sum is 6.
Adding to 101000100000111 its reverse (111000001000101), we get a palindrome (212000101000212).
The spelling of 101000100000111 in words is "one hundred one trillion, one hundred million, one hundred eleven", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •