Base | Representation |
---|---|
bin | 1011010000100… |
… | …1011000111101 |
3 | 10021212020200011 |
4 | 2310021120331 |
5 | 44042140011 |
6 | 4404103221 |
7 | 1112254261 |
oct | 264113075 |
9 | 107766604 |
10 | 47224381 |
11 | 24725416 |
12 | 13994b11 |
13 | 9a25c29 |
14 | 63b40a1 |
15 | 422c621 |
hex | 2d0963d |
47224381 has 2 divisors, whose sum is σ = 47224382. Its totient is φ = 47224380.
The previous prime is 47224369. The next prime is 47224391. The reversal of 47224381 is 18342274.
47224381 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., 29877156 + 17347225 = 5466^2 + 4165^2 .
It is a cyclic number.
It is not a de Polignac number, because 47224381 - 25 = 47224349 is a prime.
It is a super-2 number, since 2×472243812 = 4460284321666322, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47224361) 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, 23612190 + 23612191.
It is an arithmetic number, because the mean of its divisors is an integer number (23612191).
Almost surely, 247224381 is an apocalyptic number.
It is an amenable number.
47224381 is a deficient number, since it is larger than the sum of its proper divisors (1).
47224381 is an equidigital number, since it uses as much as digits as its factorization.
47224381 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 10752, while the sum is 31.
The square root of 47224381 is about 6871.9997817229. Note that the first 3 decimals coincide. The cubic root of 47224381 is about 361.4559887294.
The spelling of 47224381 in words is "forty-seven million, two hundred twenty-four thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •