Base | Representation |
---|---|
bin | 1011010000100… |
… | …0100011110001 |
3 | 10021212002000002 |
4 | 2310020203301 |
5 | 44042032402 |
6 | 4404035345 |
7 | 1112241326 |
oct | 264104361 |
9 | 107762002 |
10 | 47220977 |
11 | 24722901 |
12 | 13992b55 |
13 | 9a2450b |
14 | 63b2b4d |
15 | 422b602 |
hex | 2d088f1 |
47220977 has 4 divisors (see below), whose sum is σ = 47273280. Its totient is φ = 47168676.
The previous prime is 47220973. The next prime is 47220983. The reversal of 47220977 is 77902274.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4, and also an emirpimes, since its reverse is a distinct semiprime: 77902274 = 2 ⋅38951137.
It is a cyclic number.
It is not a de Polignac number, because 47220977 - 22 = 47220973 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 47220977.
It is not an unprimeable number, because it can be changed into a prime (47220973) 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 3 ways as a sum of consecutive naturals, for example, 24773 + ... + 26610.
It is an arithmetic number, because the mean of its divisors is an integer number (11818320).
Almost surely, 247220977 is an apocalyptic number.
It is an amenable number.
47220977 is a deficient number, since it is larger than the sum of its proper divisors (52303).
47220977 is an equidigital number, since it uses as much as digits as its factorization.
47220977 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 52302.
The product of its (nonzero) digits is 49392, while the sum is 38.
The square root of 47220977 is about 6871.7521055405. The cubic root of 47220977 is about 361.4473037683.
The spelling of 47220977 in words is "forty-seven million, two hundred twenty thousand, nine hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •