Base | Representation |
---|---|
bin | 10110111101101111100101… |
… | …001100000100010001011011 |
3 | 111020121111122201211101221202 |
4 | 112331233211030010101123 |
5 | 101214241000241024011 |
6 | 554450432053024415 |
7 | 30163003116266603 |
oct | 2675574514042133 |
9 | 436544581741852 |
10 | 101000001111131 |
11 | 2a1aa950620961 |
12 | b3b258802510b |
13 | 444834a710455 |
14 | 1ad25d7467c03 |
15 | ba23961a523b |
hex | 5bdbe530445b |
101000001111131 has 2 divisors, whose sum is σ = 101000001111132. Its totient is φ = 101000001111130.
The previous prime is 101000001111017. The next prime is 101000001111257. The reversal of 101000001111131 is 131111100000101.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 101000001111131 - 214 = 101000001094747 is a prime.
It is a super-2 number, since 2×1010000011111312 (a number of 29 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (101000001110131) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50500000555565 + 50500000555566.
It is an arithmetic number, because the mean of its divisors is an integer number (50500000555566).
Almost surely, 2101000001111131 is an apocalyptic number.
101000001111131 is a deficient number, since it is larger than the sum of its proper divisors (1).
101000001111131 is an equidigital number, since it uses as much as digits as its factorization.
101000001111131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3, while the sum is 11.
Adding to 101000001111131 its reverse (131111100000101), we get a palindrome (232111101111232).
The spelling of 101000001111131 in words is "one hundred one trillion, one million, one hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •