Base | Representation |
---|---|
bin | 1111100110000… |
… | …10101000010101 |
3 | 100010011101011111 |
4 | 13303002220111 |
5 | 231442230004 |
6 | 20551535021 |
7 | 3145646152 |
oct | 763025025 |
9 | 303141144 |
10 | 130820629 |
11 | 67932525 |
12 | 3798a471 |
13 | 21145174 |
14 | 13535229 |
15 | b741a04 |
hex | 7cc2a15 |
130820629 has 2 divisors, whose sum is σ = 130820630. Its totient is φ = 130820628.
The previous prime is 130820621. The next prime is 130820647. The reversal of 130820629 is 926028031.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 100460529 + 30360100 = 10023^2 + 5510^2 .
It is a cyclic number.
It is not a de Polignac number, because 130820629 - 23 = 130820621 is a prime.
It is a super-2 number, since 2×1308206292 = 34228073943911282, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 130820629.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (130820621) 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, 65410314 + 65410315.
It is an arithmetic number, because the mean of its divisors is an integer number (65410315).
Almost surely, 2130820629 is an apocalyptic number.
It is an amenable number.
130820629 is a deficient number, since it is larger than the sum of its proper divisors (1).
130820629 is an equidigital number, since it uses as much as digits as its factorization.
130820629 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 5184, while the sum is 31.
The square root of 130820629 is about 11437.6845996032. The cubic root of 130820629 is about 507.6434001491.
The spelling of 130820629 in words is "one hundred thirty million, eight hundred twenty thousand, six hundred twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •