Base | Representation |
---|---|
bin | 1011001101101… |
… | …0100100110001 |
3 | 10021111111122002 |
4 | 2303122210301 |
5 | 44020021000 |
6 | 4400023345 |
7 | 1110525233 |
oct | 263324461 |
9 | 107444562 |
10 | 47032625 |
11 | 24604342 |
12 | 13901b55 |
13 | 9989873 |
14 | 6364253 |
15 | 41e08d5 |
hex | 2cda931 |
47032625 has 16 divisors (see below), whose sum is σ = 62152272. Its totient is φ = 35411200.
The previous prime is 47032621. The next prime is 47032639. The reversal of 47032625 is 52623074.
47032625 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 9480241 + 37552384 = 3079^2 + 6128^2 .
It is not a de Polignac number, because 47032625 - 22 = 47032621 is a prime.
It is not an unprimeable number, because it can be changed into a prime (47032621) 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, 8942 + ... + 13191.
It is an arithmetic number, because the mean of its divisors is an integer number (3884517).
Almost surely, 247032625 is an apocalyptic number.
It is an amenable number.
47032625 is a deficient number, since it is larger than the sum of its proper divisors (15119647).
47032625 is a wasteful number, since it uses less digits than its factorization.
47032625 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22165 (or 22155 counting only the distinct ones).
The product of its (nonzero) digits is 10080, while the sum is 29.
The square root of 47032625 is about 6858.0336102997. The cubic root of 47032625 is about 360.9660907932.
Adding to 47032625 its reverse (52623074), we get a palindrome (99655699).
The spelling of 47032625 in words is "forty-seven million, thirty-two thousand, six hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •