Base | Representation |
---|---|
bin | 111100110100001101… |
… | …0001011000000010111 |
3 | 110111002210021111001112 |
4 | 1321220122023000113 |
5 | 4114432240211132 |
6 | 135555214245235 |
7 | 12302256501644 |
oct | 1715032130027 |
9 | 414083244045 |
10 | 130600710167 |
11 | 50429772614 |
12 | 21389ab681b |
13 | c41448b735 |
14 | 646d198dcb |
15 | 35e5971ab2 |
hex | 1e6868b017 |
130600710167 has 2 divisors, whose sum is σ = 130600710168. Its totient is φ = 130600710166.
The previous prime is 130600710137. The next prime is 130600710209. The reversal of 130600710167 is 761017006031.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130600710167 - 210 = 130600709143 is a prime.
It is a super-2 number, since 2×1306007101672 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130600710137) 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, 65300355083 + 65300355084.
It is an arithmetic number, because the mean of its divisors is an integer number (65300355084).
Almost surely, 2130600710167 is an apocalyptic number.
130600710167 is a deficient number, since it is larger than the sum of its proper divisors (1).
130600710167 is an equidigital number, since it uses as much as digits as its factorization.
130600710167 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5292, while the sum is 32.
Adding to 130600710167 its reverse (761017006031), we get a palindrome (891617716198).
The spelling of 130600710167 in words is "one hundred thirty billion, six hundred million, seven hundred ten thousand, one hundred sixty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •