Base | Representation |
---|---|
bin | 1011010001000… |
… | …0001011111101 |
3 | 10021220122212021 |
4 | 2310100023331 |
5 | 44044032341 |
6 | 4404440141 |
7 | 1112431402 |
oct | 264201375 |
9 | 107818767 |
10 | 47252221 |
11 | 24744325 |
12 | 139a9051 |
13 | 9a357c3 |
14 | 63c02a9 |
15 | 42359d1 |
hex | 2d102fd |
47252221 has 8 divisors (see below), whose sum is σ = 50076000. Its totient is φ = 44462160.
The previous prime is 47252209. The next prime is 47252237. The reversal of 47252221 is 12225274.
47252221 = 15682 + 15692 + ... + 15862.
47252221 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 47252221 - 221 = 45155069 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (47252201) 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 7 ways as a sum of consecutive naturals, for example, 5515 + ... + 11176.
It is an arithmetic number, because the mean of its divisors is an integer number (6259500).
Almost surely, 247252221 is an apocalyptic number.
It is an amenable number.
47252221 is a deficient number, since it is larger than the sum of its proper divisors (2823779).
47252221 is a wasteful number, since it uses less digits than its factorization.
47252221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16859.
The product of its digits is 2240, while the sum is 25.
The square root of 47252221 is about 6874.0250945134. The cubic root of 47252221 is about 361.5270040095.
Adding to 47252221 its reverse (12225274), we get a palindrome (59477495).
The spelling of 47252221 in words is "forty-seven million, two hundred fifty-two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •