Base | Representation |
---|---|
bin | 111100101011001110… |
… | …0010000010100101111 |
3 | 110110022210001112212202 |
4 | 1321112130100110233 |
5 | 4113323103010401 |
6 | 135505245252115 |
7 | 12261636330002 |
oct | 1712634202457 |
9 | 413283045782 |
10 | 130299266351 |
11 | 502945a23a1 |
12 | 21304b6403b |
13 | c396ba6707 |
14 | 644112b539 |
15 | 35c927a06b |
hex | 1e5671052f |
130299266351 has 2 divisors, whose sum is σ = 130299266352. Its totient is φ = 130299266350.
The previous prime is 130299266329. The next prime is 130299266353. The reversal of 130299266351 is 153662992031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130299266351 - 226 = 130232157487 is a prime.
Together with 130299266353, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 130299266296 and 130299266305.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130299266353) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65149633175 + 65149633176.
It is an arithmetic number, because the mean of its divisors is an integer number (65149633176).
Almost surely, 2130299266351 is an apocalyptic number.
130299266351 is a deficient number, since it is larger than the sum of its proper divisors (1).
130299266351 is an equidigital number, since it uses as much as digits as its factorization.
130299266351 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 524880, while the sum is 47.
The spelling of 130299266351 in words is "one hundred thirty billion, two hundred ninety-nine million, two hundred sixty-six thousand, three hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •