Base | Representation |
---|---|
bin | 1111100101100… |
… | …01110010100011 |
3 | 100010000212112202 |
4 | 13302301302203 |
5 | 231433023101 |
6 | 20550243415 |
7 | 3145241102 |
oct | 762616243 |
9 | 303025482 |
10 | 130751651 |
11 | 67895718 |
12 | 3795656b |
13 | 2111c954 |
14 | 13518039 |
15 | b72b36b |
hex | 7cb1ca3 |
130751651 has 2 divisors, whose sum is σ = 130751652. Its totient is φ = 130751650.
The previous prime is 130751629. The next prime is 130751657. The reversal of 130751651 is 156157031.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 130751651 - 26 = 130751587 is a prime.
It is a Sophie Germain prime.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (130751657) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 65375825 + 65375826.
It is an arithmetic number, because the mean of its divisors is an integer number (65375826).
Almost surely, 2130751651 is an apocalyptic number.
130751651 is a deficient number, since it is larger than the sum of its proper divisors (1).
130751651 is an equidigital number, since it uses as much as digits as its factorization.
130751651 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3150, while the sum is 29.
The square root of 130751651 is about 11434.6688189908. The cubic root of 130751651 is about 507.5541624836.
The spelling of 130751651 in words is "one hundred thirty million, seven hundred fifty-one thousand, six hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.111 sec. • engine limits •