Base | Representation |
---|---|
bin | 111100100101011000… |
… | …0010111000000111111 |
3 | 110102211010010212012011 |
4 | 1321022300113000333 |
5 | 4112422410210142 |
6 | 135434003152051 |
7 | 12254036016166 |
oct | 1711260270077 |
9 | 412733125164 |
10 | 130103210047 |
11 | 501a3963398 |
12 | 2126b375627 |
13 | c3653a0475 |
14 | 64230943dd |
15 | 35b6e4e417 |
hex | 1e4ac1703f |
130103210047 has 2 divisors, whose sum is σ = 130103210048. Its totient is φ = 130103210046.
The previous prime is 130103210009. The next prime is 130103210071. The reversal of 130103210047 is 740012301031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130103210047 - 219 = 130102685759 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130103210147) 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, 65051605023 + 65051605024.
It is an arithmetic number, because the mean of its divisors is an integer number (65051605024).
Almost surely, 2130103210047 is an apocalyptic number.
130103210047 is a deficient number, since it is larger than the sum of its proper divisors (1).
130103210047 is an equidigital number, since it uses as much as digits as its factorization.
130103210047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 504, while the sum is 22.
Adding to 130103210047 its reverse (740012301031), we get a palindrome (870115511078).
The spelling of 130103210047 in words is "one hundred thirty billion, one hundred three million, two hundred ten thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •