Base | Representation |
---|---|
bin | 1011010010001… |
… | …1001011011001 |
3 | 10022001121120022 |
4 | 2310203023121 |
5 | 44104030014 |
6 | 4410240225 |
7 | 1113204236 |
oct | 264431331 |
9 | 108047508 |
10 | 47330009 |
11 | 24797811 |
12 | 13a26075 |
13 | 9a6202c |
14 | 640078d |
15 | 424da8e |
hex | 2d232d9 |
47330009 has 2 divisors, whose sum is σ = 47330010. Its totient is φ = 47330008.
The previous prime is 47329973. The next prime is 47330011. The reversal of 47330009 is 90003374.
47330009 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 47224384 + 105625 = 6872^2 + 325^2 .
It is a cyclic number.
It is not a de Polignac number, because 47330009 - 28 = 47329753 is a prime.
Together with 47330011, it forms a pair of twin primes.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 47330009.
It is not a weakly prime, because it can be changed into another prime (47330509) 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, 23665004 + 23665005.
It is an arithmetic number, because the mean of its divisors is an integer number (23665005).
Almost surely, 247330009 is an apocalyptic number.
It is an amenable number.
47330009 is a deficient number, since it is larger than the sum of its proper divisors (1).
47330009 is an equidigital number, since it uses as much as digits as its factorization.
47330009 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2268, while the sum is 26.
The square root of 47330009 is about 6879.6808792269. The cubic root of 47330009 is about 361.7252807189.
The spelling of 47330009 in words is "forty-seven million, three hundred thirty thousand, nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •