Base | Representation |
---|---|
bin | 111100101010010000… |
… | …0110111010001001001 |
3 | 110110020112012012001002 |
4 | 1321110200313101021 |
5 | 4113241312420014 |
6 | 135502132104345 |
7 | 12261064356542 |
oct | 1712440672111 |
9 | 413215165032 |
10 | 130266920009 |
11 | 5027830a086 |
12 | 212b61650b5 |
13 | c39028c775 |
14 | 643ab0b4c9 |
15 | 35c64dadde |
hex | 1e54837449 |
130266920009 has 2 divisors, whose sum is σ = 130266920010. Its totient is φ = 130266920008.
The previous prime is 130266919987. The next prime is 130266920027. The reversal of 130266920009 is 900029662031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 71534851600 + 58732068409 = 267460^2 + 242347^2 .
It is an emirp because it is prime and its reverse (900029662031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130266920009 - 28 = 130266919753 is a prime.
It is not a weakly prime, because it can be changed into another prime (130266920209) 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, 65133460004 + 65133460005.
It is an arithmetic number, because the mean of its divisors is an integer number (65133460005).
Almost surely, 2130266920009 is an apocalyptic number.
It is an amenable number.
130266920009 is a deficient number, since it is larger than the sum of its proper divisors (1).
130266920009 is an equidigital number, since it uses as much as digits as its factorization.
130266920009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 34992, while the sum is 38.
The spelling of 130266920009 in words is "one hundred thirty billion, two hundred sixty-six million, nine hundred twenty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •