Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001100000100000001110011 |
3 | 111020121111122201211100120201 |
4 | 112331233211030010001303 |
5 | 101214241000241011011 |
6 | 554450432053020031 |
7 | 30163003116263644 |
oct | 2675574514040163 |
9 | 436544581740521 |
10 | 101000001110131 |
11 | 2a1aa950620132 |
12 | b3b2588024617 |
13 | 444834a70cb66 |
14 | 1ad25d74676cb |
15 | ba23961a4cc1 |
hex | 5bdbe5304073 |
101000001110131 has 2 divisors, whose sum is σ = 101000001110132. Its totient is φ = 101000001110130.
The previous prime is 101000001110089. The next prime is 101000001110149. The reversal of 101000001110131 is 131011100000101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101000001110131 - 239 = 100450245296243 is a prime.
It is a super-2 number, since 2×1010000011101312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101000001110191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500000555065 + 50500000555066.
It is an arithmetic number, because the mean of its divisors is an integer number (50500000555066).
Almost surely, 2101000001110131 is an apocalyptic number.
101000001110131 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000001110131 is an equidigital number, since it uses as much as digits as its factorization.
101000001110131 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3, while the sum is 10.
Adding to 101000001110131 its reverse (131011100000101), we get a palindrome (232011101110232).
The spelling of 101000001110131 in words is "one hundred one trillion, one million, one hundred ten thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •