Base | Representation |
---|---|
bin | 111100101000101010… |
… | …0011001100100001011 |
3 | 110110002210100001222112 |
4 | 1321101110121210023 |
5 | 4113134102232341 |
6 | 135452535212535 |
7 | 12256543652246 |
oct | 1712124314413 |
9 | 413083301875 |
10 | 130213320971 |
11 | 50250030358 |
12 | 212a021714b |
13 | c382144166 |
14 | 643395825d |
15 | 35c194eaeb |
hex | 1e5151990b |
130213320971 has 2 divisors, whose sum is σ = 130213320972. Its totient is φ = 130213320970.
The previous prime is 130213320959. The next prime is 130213320973. The reversal of 130213320971 is 179023312031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130213320971 - 210 = 130213319947 is a prime.
Together with 130213320973, 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 (130213320973) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65106660485 + 65106660486.
It is an arithmetic number, because the mean of its divisors is an integer number (65106660486).
Almost surely, 2130213320971 is an apocalyptic number.
130213320971 is a deficient number, since it is larger than the sum of its proper divisors (1).
130213320971 is an equidigital number, since it uses as much as digits as its factorization.
130213320971 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 32.
The spelling of 130213320971 in words is "one hundred thirty billion, two hundred thirteen million, three hundred twenty thousand, nine hundred seventy-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •