Base | Representation |
---|---|
bin | 111100100101010110… |
… | …1000000011011101001 |
3 | 110102211001111012112001 |
4 | 1321022231000123221 |
5 | 4112422144043423 |
6 | 135433532251001 |
7 | 12254025365536 |
oct | 1711255003351 |
9 | 412731435461 |
10 | 130102331113 |
11 | 501a3412aa7 |
12 | 2126b010a61 |
13 | c3651533a1 |
14 | 6422d05d8d |
15 | 35b6d28cad |
hex | 1e4ab406e9 |
130102331113 has 2 divisors, whose sum is σ = 130102331114. Its totient is φ = 130102331112.
The previous prime is 130102331089. The next prime is 130102331123. The reversal of 130102331113 is 311133201031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 102638218384 + 27464112729 = 320372^2 + 165723^2 .
It is a cyclic number.
It is not a de Polignac number, because 130102331113 - 213 = 130102322921 is a prime.
It is a super-2 number, since 2×1301023311132 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (130102331123) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65051165556 + 65051165557.
It is an arithmetic number, because the mean of its divisors is an integer number (65051165557).
Almost surely, 2130102331113 is an apocalyptic number.
It is an amenable number.
130102331113 is a deficient number, since it is larger than the sum of its proper divisors (1).
130102331113 is an equidigital number, since it uses as much as digits as its factorization.
130102331113 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 130102331113 its reverse (311133201031), we get a palindrome (441235532144).
The spelling of 130102331113 in words is "one hundred thirty billion, one hundred two million, three hundred thirty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •