Base | Representation |
---|---|
bin | 111100100101100101… |
… | …1011111001000101101 |
3 | 110102211121112010212002 |
4 | 1321023023133020231 |
5 | 4112431220234242 |
6 | 135434415422045 |
7 | 12254153324333 |
oct | 1711313371055 |
9 | 412747463762 |
10 | 130110321197 |
11 | 501a798007a |
12 | 21271824925 |
13 | c3669c014c |
14 | 6423dc5b53 |
15 | 35b78a6432 |
hex | 1e4b2df22d |
130110321197 has 2 divisors, whose sum is σ = 130110321198. Its totient is φ = 130110321196.
The previous prime is 130110321053. The next prime is 130110321199. The reversal of 130110321197 is 791123011031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67377104041 + 62733217156 = 259571^2 + 250466^2 .
It is a cyclic number.
It is not a de Polignac number, because 130110321197 - 212 = 130110317101 is a prime.
Together with 130110321199, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130110321199) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65055160598 + 65055160599.
It is an arithmetic number, because the mean of its divisors is an integer number (65055160599).
Almost surely, 2130110321197 is an apocalyptic number.
It is an amenable number.
130110321197 is a deficient number, since it is larger than the sum of its proper divisors (1).
130110321197 is an equidigital number, since it uses as much as digits as its factorization.
130110321197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1134, while the sum is 29.
The spelling of 130110321197 in words is "one hundred thirty billion, one hundred ten million, three hundred twenty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •