Base | Representation |
---|---|
bin | 1111100101001… |
… | …10101111101101 |
3 | 100002221120111021 |
4 | 13302212233231 |
5 | 231430101123 |
6 | 20545254141 |
7 | 3144662155 |
oct | 762465755 |
9 | 302846437 |
10 | 130706413 |
11 | 67864732 |
12 | 37934351 |
13 | 21105196 |
14 | 13505765 |
15 | b71cc5d |
hex | 7ca6bed |
130706413 has 2 divisors, whose sum is σ = 130706414. Its totient is φ = 130706412.
The previous prime is 130706383. The next prime is 130706431. The reversal of 130706413 is 314607031.
Together with next prime (130706431) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 77387209 + 53319204 = 8797^2 + 7302^2 .
It is an emirp because it is prime and its reverse (314607031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130706413 - 29 = 130705901 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130700413) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65353206 + 65353207.
It is an arithmetic number, because the mean of its divisors is an integer number (65353207).
Almost surely, 2130706413 is an apocalyptic number.
It is an amenable number.
130706413 is a deficient number, since it is larger than the sum of its proper divisors (1).
130706413 is an equidigital number, since it uses as much as digits as its factorization.
130706413 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1512, while the sum is 25.
The square root of 130706413 is about 11432.6905407257. The cubic root of 130706413 is about 507.4956204982.
The spelling of 130706413 in words is "one hundred thirty million, seven hundred six thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •