Base | Representation |
---|---|
bin | 1111100001000… |
… | …11000010100111 |
3 | 100001221011111012 |
4 | 13300203002213 |
5 | 231310320301 |
6 | 20525532435 |
7 | 3140254325 |
oct | 760430247 |
9 | 301834435 |
10 | 130166951 |
11 | 675263a2 |
12 | 3771411b |
13 | 20c76785 |
14 | 13404d15 |
15 | b662ebb |
hex | 7c230a7 |
130166951 has 2 divisors, whose sum is σ = 130166952. Its totient is φ = 130166950.
The previous prime is 130166941. The next prime is 130166989. The reversal of 130166951 is 159661031.
It is a happy number.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 130166951 - 226 = 63058087 is a prime.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130166941) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65083475 + 65083476.
It is an arithmetic number, because the mean of its divisors is an integer number (65083476).
Almost surely, 2130166951 is an apocalyptic number.
130166951 is a deficient number, since it is larger than the sum of its proper divisors (1).
130166951 is an equidigital number, since it uses as much as digits as its factorization.
130166951 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4860, while the sum is 32.
The square root of 130166951 is about 11409.0731875994. The cubic root of 130166951 is about 506.7964655235.
The spelling of 130166951 in words is "one hundred thirty million, one hundred sixty-six thousand, nine hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •