Base | Representation |
---|---|
bin | 111100110010110010… |
… | …0100101001000000011 |
3 | 110110222110200222201022 |
4 | 1321211210211020003 |
5 | 4114333043410242 |
6 | 135550354100055 |
7 | 12301141046024 |
oct | 1714544451003 |
9 | 413873628638 |
10 | 130553106947 |
11 | 5040490960a |
12 | 21375b7a62b |
13 | c407662253 |
14 | 6466b26c4b |
15 | 35e16bc0d2 |
hex | 1e65925203 |
130553106947 has 2 divisors, whose sum is σ = 130553106948. Its totient is φ = 130553106946.
The previous prime is 130553106941. The next prime is 130553106967. The reversal of 130553106947 is 749601355031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130553106947 - 26 = 130553106883 is a prime.
It is a super-2 number, since 2×1305531069472 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 130553106898 and 130553106907.
It is not a weakly prime, because it can be changed into another prime (130553106941) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65276553473 + 65276553474.
It is an arithmetic number, because the mean of its divisors is an integer number (65276553474).
Almost surely, 2130553106947 is an apocalyptic number.
130553106947 is a deficient number, since it is larger than the sum of its proper divisors (1).
130553106947 is an equidigital number, since it uses as much as digits as its factorization.
130553106947 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 340200, while the sum is 44.
The spelling of 130553106947 in words is "one hundred thirty billion, five hundred fifty-three million, one hundred six thousand, nine hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.166 sec. • engine limits •