Base | Representation |
---|---|
bin | 1111100101000… |
… | …11111010001101 |
3 | 100002220222120001 |
4 | 13302203322031 |
5 | 231424213142 |
6 | 20545124301 |
7 | 3144613252 |
oct | 762437215 |
9 | 302828501 |
10 | 130694797 |
11 | 67856a32 |
12 | 37929691 |
13 | 210ccacc |
14 | 13501429 |
15 | b7195b7 |
hex | 7ca3e8d |
130694797 has 2 divisors, whose sum is σ = 130694798. Its totient is φ = 130694796.
The previous prime is 130694779. The next prime is 130694801. The reversal of 130694797 is 797496031.
Together with previous prime (130694779) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 67667076 + 63027721 = 8226^2 + 7939^2 .
It is a cyclic number.
It is not a de Polignac number, because 130694797 - 215 = 130662029 is a prime.
It is a super-2 number, since 2×1306947972 = 34162259925742418, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130694737) by changing a digit.
It is a good prime.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65347398 + 65347399.
It is an arithmetic number, because the mean of its divisors is an integer number (65347399).
Almost surely, 2130694797 is an apocalyptic number.
It is an amenable number.
130694797 is a deficient number, since it is larger than the sum of its proper divisors (1).
130694797 is an equidigital number, since it uses as much as digits as its factorization.
130694797 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 285768, while the sum is 46.
The square root of 130694797 is about 11432.1825125389. The cubic root of 130694797 is about 507.4805861842.
The spelling of 130694797 in words is "one hundred thirty million, six hundred ninety-four thousand, seven hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.241 sec. • engine limits •