Base | Representation |
---|---|
bin | 1111100101000… |
… | …11111111110101 |
3 | 100002221000001101 |
4 | 13302203333311 |
5 | 231424221112 |
6 | 20545130101 |
7 | 3144614305 |
oct | 762437765 |
9 | 302830041 |
10 | 130695157 |
11 | 6785722a |
12 | 37929931 |
13 | 21100018 |
14 | 13501605 |
15 | b719757 |
hex | 7ca3ff5 |
130695157 has 2 divisors, whose sum is σ = 130695158. Its totient is φ = 130695156.
The previous prime is 130695143. The next prime is 130695197. The reversal of 130695157 is 751596031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 115648516 + 15046641 = 10754^2 + 3879^2 .
It is an emirp because it is prime and its reverse (751596031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130695157 - 211 = 130693109 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130695107) 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, 65347578 + 65347579.
It is an arithmetic number, because the mean of its divisors is an integer number (65347579).
Almost surely, 2130695157 is an apocalyptic number.
It is an amenable number.
130695157 is a deficient number, since it is larger than the sum of its proper divisors (1).
130695157 is an equidigital number, since it uses as much as digits as its factorization.
130695157 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28350, while the sum is 37.
The square root of 130695157 is about 11432.1982575531. The cubic root of 130695157 is about 507.4810521370.
The spelling of 130695157 in words is "one hundred thirty million, six hundred ninety-five thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •