Base | Representation |
---|---|
bin | 1111100001110… |
… | …10111111000101 |
3 | 100002010011000201 |
4 | 13300322333011 |
5 | 231321440104 |
6 | 20532010501 |
7 | 3141143266 |
oct | 760727705 |
9 | 302104021 |
10 | 130265029 |
11 | 67593054 |
12 | 37760a31 |
13 | 20cac2cb |
14 | 1342c96d |
15 | b6820a4 |
hex | 7c3afc5 |
130265029 has 4 divisors (see below), whose sum is σ = 130396684. Its totient is φ = 130133376.
The previous prime is 130264997. The next prime is 130265081. The reversal of 130265029 is 920562031.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 99960004 + 30305025 = 9998^2 + 5505^2 .
It is a cyclic number.
It is not a de Polignac number, because 130265029 - 25 = 130264997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 130264988 and 130265006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (130265089) 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 in 3 ways as a sum of consecutive naturals, for example, 64332 + ... + 66325.
It is an arithmetic number, because the mean of its divisors is an integer number (32599171).
Almost surely, 2130265029 is an apocalyptic number.
It is an amenable number.
130265029 is a deficient number, since it is larger than the sum of its proper divisors (131655).
130265029 is an equidigital number, since it uses as much as digits as its factorization.
130265029 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 131654.
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 130265029 is about 11413.3706239656. The cubic root of 130265029 is about 506.9237203158.
The spelling of 130265029 in words is "one hundred thirty million, two hundred sixty-five thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •