Base | Representation |
---|---|
bin | 111100100101010011… |
… | …1111101111001101111 |
3 | 110102210222000002100002 |
4 | 1321022213331321233 |
5 | 4112421324310111 |
6 | 135433444054515 |
7 | 12254011224146 |
oct | 1711247757157 |
9 | 412728002302 |
10 | 130101010031 |
11 | 501a26a04a3 |
12 | 2126a69443b |
13 | c364aacc95 |
14 | 6422a8075d |
15 | 35b6b6763b |
hex | 1e4a9fde6f |
130101010031 has 2 divisors, whose sum is σ = 130101010032. Its totient is φ = 130101010030.
The previous prime is 130101009991. The next prime is 130101010063. The reversal of 130101010031 is 130010101031.
It is a happy number.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130101010031 - 222 = 130096815727 is a prime.
It is a super-2 number, since 2×1301010100312 (a number of 23 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 130101009994 and 130101010021.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130101810031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65050505015 + 65050505016.
It is an arithmetic number, because the mean of its divisors is an integer number (65050505016).
Almost surely, 2130101010031 is an apocalyptic number.
130101010031 is a deficient number, since it is larger than the sum of its proper divisors (1).
130101010031 is an equidigital number, since it uses as much as digits as its factorization.
130101010031 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 11.
Adding to 130101010031 its reverse (130010101031), we get a palindrome (260111111062).
The spelling of 130101010031 in words is "one hundred thirty billion, one hundred one million, ten thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •