Base | Representation |
---|---|
bin | 1111100100101… |
… | …11111000011011 |
3 | 100002211110222101 |
4 | 13302113320123 |
5 | 231421124111 |
6 | 20544104231 |
7 | 3144316522 |
oct | 762277033 |
9 | 302743871 |
10 | 130645531 |
11 | 67822a15 |
12 | 37905077 |
13 | 210b3563 |
14 | 134cb4b9 |
15 | b709bc1 |
hex | 7c97e1b |
130645531 has 2 divisors, whose sum is σ = 130645532. Its totient is φ = 130645530.
The previous prime is 130645523. The next prime is 130645601. The reversal of 130645531 is 135546031.
It is a weak prime.
It is an emirp because it is prime and its reverse (135546031) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 130645531 - 23 = 130645523 is a prime.
It is a super-2 number, since 2×1306455312 = 34136509540543922, which contains 22 as substring.
It is a Chen prime.
It is a pancake number, because a pancake can be divided into 130645531 parts by 16164 straight cuts.
It is a self number, because there is not a number n which added to its sum of digits gives 130645531.
It is not a weakly prime, because it can be changed into another prime (130646531) 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, 65322765 + 65322766.
It is an arithmetic number, because the mean of its divisors is an integer number (65322766).
Almost surely, 2130645531 is an apocalyptic number.
130645531 is a deficient number, since it is larger than the sum of its proper divisors (1).
130645531 is an equidigital number, since it uses as much as digits as its factorization.
130645531 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5400, while the sum is 28.
The square root of 130645531 is about 11430.0276027663. The cubic root of 130645531 is about 507.4168124628.
The spelling of 130645531 in words is "one hundred thirty million, six hundred forty-five thousand, five hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •