Base | Representation |
---|---|
bin | 1001010111100110010000… |
… | …0111101011101000011011 |
3 | 1100110202201012010012122022 |
4 | 2111321210013223220123 |
5 | 2322232432343424011 |
6 | 33524115210045055 |
7 | 2112136443310622 |
oct | 225714407535033 |
9 | 40422635105568 |
10 | 10301011311131 |
11 | 33116a837a342 |
12 | 11a44a3a1978b |
13 | 5994c5654888 |
14 | 2788006c46b9 |
15 | 12ce462b98db |
hex | 95e641eba1b |
10301011311131 has 2 divisors, whose sum is σ = 10301011311132. Its totient is φ = 10301011311130.
The previous prime is 10301011311053. The next prime is 10301011311133. The reversal of 10301011311131 is 13111311010301.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10301011311131 - 238 = 10026133404187 is a prime.
It is a super-2 number, since 2×103010113111312 (a number of 27 digits) contains 22 as substring.
Together with 10301011311133, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (10301011311133) 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, 5150505655565 + 5150505655566.
It is an arithmetic number, because the mean of its divisors is an integer number (5150505655566).
Almost surely, 210301011311131 is an apocalyptic number.
10301011311131 is a deficient number, since it is larger than the sum of its proper divisors (1).
10301011311131 is an equidigital number, since it uses as much as digits as its factorization.
10301011311131 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 27, while the sum is 17.
Adding to 10301011311131 its reverse (13111311010301), we get a palindrome (23412322321432).
The spelling of 10301011311131 in words is "ten trillion, three hundred one billion, eleven million, three hundred eleven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •