Base | Representation |
---|---|
bin | 111100110100001101… |
… | …0001011000001000001 |
3 | 110111002210021111010002 |
4 | 1321220122023001001 |
5 | 4114432240211314 |
6 | 135555214245345 |
7 | 12302256502034 |
oct | 1715032130101 |
9 | 414083244102 |
10 | 130600710209 |
11 | 50429772652 |
12 | 21389ab6855 |
13 | c41448b768 |
14 | 646d19901b |
15 | 35e5971ade |
hex | 1e6868b041 |
130600710209 has 2 divisors, whose sum is σ = 130600710210. Its totient is φ = 130600710208.
The previous prime is 130600710167. The next prime is 130600710211. The reversal of 130600710209 is 902017006031.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 95745687184 + 34855023025 = 309428^2 + 186695^2 .
It is a cyclic number.
It is not a de Polignac number, because 130600710209 - 212 = 130600706113 is a prime.
It is a Sophie Germain prime.
Together with 130600710211, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (130600710259) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65300355104 + 65300355105.
It is an arithmetic number, because the mean of its divisors is an integer number (65300355105).
Almost surely, 2130600710209 is an apocalyptic number.
It is an amenable number.
130600710209 is a deficient number, since it is larger than the sum of its proper divisors (1).
130600710209 is an equidigital number, since it uses as much as digits as its factorization.
130600710209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 29.
The spelling of 130600710209 in words is "one hundred thirty billion, six hundred million, seven hundred ten thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •