Base | Representation |
---|---|
bin | 101111000101111010… |
… | …0110000111111110011 |
3 | 100200000221011000212011 |
4 | 1132023310300333303 |
5 | 3124103302104021 |
6 | 114243013143351 |
7 | 10210045530424 |
oct | 1361364607763 |
9 | 320027130764 |
10 | 101130113011 |
11 | 399863487a4 |
12 | 1772432ab57 |
13 | 96c89a4975 |
14 | 4c7519b64b |
15 | 296d56cde1 |
hex | 178bd30ff3 |
101130113011 has 2 divisors, whose sum is σ = 101130113012. Its totient is φ = 101130113010.
The previous prime is 101130113003. The next prime is 101130113017. The reversal of 101130113011 is 110311031101.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 101130113011 - 23 = 101130113003 is a prime.
It is a super-2 number, since 2×1011301130112 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 101130112982 and 101130113000.
It is not a weakly prime, because it can be changed into another prime (101130113017) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50565056505 + 50565056506.
It is an arithmetic number, because the mean of its divisors is an integer number (50565056506).
Almost surely, 2101130113011 is an apocalyptic number.
101130113011 is a deficient number, since it is larger than the sum of its proper divisors (1).
101130113011 is an equidigital number, since it uses as much as digits as its factorization.
101130113011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9, while the sum is 13.
Adding to 101130113011 its reverse (110311031101), we get a palindrome (211441144112).
The spelling of 101130113011 in words is "one hundred one billion, one hundred thirty million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.091 sec. • engine limits •