Base | Representation |
---|---|
bin | 1011010000101… |
… | …0101100001001 |
3 | 10021212111222100 |
4 | 2310022230021 |
5 | 44042322310 |
6 | 4404144013 |
7 | 1112305635 |
oct | 264125411 |
9 | 107774870 |
10 | 47229705 |
11 | 24729416 |
12 | 13998009 |
13 | 9a28493 |
14 | 63b5dc5 |
15 | 422dec0 |
hex | 2d0ab09 |
47229705 has 12 divisors (see below), whose sum is σ = 81864900. Its totient is φ = 25189152.
The previous prime is 47229703. The next prime is 47229733. The reversal of 47229705 is 50792274.
It can be written as a sum of positive squares in 2 ways, for example, as 33212169 + 14017536 = 5763^2 + 3744^2 .
It is not a de Polignac number, because 47229705 - 21 = 47229703 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 47229705.
It is not an unprimeable number, because it can be changed into a prime (47229703) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 524730 + ... + 524819.
It is an arithmetic number, because the mean of its divisors is an integer number (6822075).
Almost surely, 247229705 is an apocalyptic number.
47229705 is a gapful number since it is divisible by the number (45) formed by its first and last digit.
It is an amenable number.
47229705 is a deficient number, since it is larger than the sum of its proper divisors (34635195).
47229705 is a wasteful number, since it uses less digits than its factorization.
47229705 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049560 (or 1049557 counting only the distinct ones).
The product of its (nonzero) digits is 35280, while the sum is 36.
The square root of 47229705 is about 6872.3871398518. The cubic root of 47229705 is about 361.4695715394.
The spelling of 47229705 in words is "forty-seven million, two hundred twenty-nine thousand, seven hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •