Base | Representation |
---|---|
bin | 111000100000… |
… | …1111010101101 |
3 | 2001202100220001 |
4 | 1301001322231 |
5 | 30041131000 |
6 | 2535024301 |
7 | 506565130 |
oct | 161017255 |
9 | 61670801 |
10 | 29630125 |
11 | 157a8608 |
12 | 9b0b091 |
13 | 61a5825 |
14 | 3d14217 |
15 | 290446a |
hex | 1c41ead |
29630125 has 16 divisors (see below), whose sum is σ = 42262272. Its totient is φ = 20317200.
The previous prime is 29630123. The next prime is 29630143. The reversal of 29630125 is 52103692.
It is not a de Polignac number, because 29630125 - 21 = 29630123 is a prime.
It is an alternating number because its digits alternate between even and odd.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 29630093 and 29630102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (29630123) 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 in 15 ways as a sum of consecutive naturals, for example, 16057 + ... + 17806.
It is an arithmetic number, because the mean of its divisors is an integer number (2641392).
Almost surely, 229630125 is an apocalyptic number.
29630125 is a gapful number since it is divisible by the number (25) formed by its first and last digit.
It is an amenable number.
29630125 is a deficient number, since it is larger than the sum of its proper divisors (12632147).
29630125 is an equidigital number, since it uses as much as digits as its factorization.
29630125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 33885 (or 33875 counting only the distinct ones).
The product of its (nonzero) digits is 3240, while the sum is 28.
The square root of 29630125 is about 5443.3560420020. The cubic root of 29630125 is about 309.4409800438.
The spelling of 29630125 in words is "twenty-nine million, six hundred thirty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •