Base | Representation |
---|---|
bin | 1011011011010… |
… | …0111101111001 |
3 | 10100011221201001 |
4 | 2312310331321 |
5 | 44232132121 |
6 | 4431125001 |
7 | 1121242222 |
oct | 266647571 |
9 | 110157631 |
10 | 47927161 |
11 | 25065427 |
12 | 14073761 |
13 | 9c10a89 |
14 | 6518249 |
15 | 431a991 |
hex | 2db4f79 |
47927161 has 2 divisors, whose sum is σ = 47927162. Its totient is φ = 47927160.
The previous prime is 47927153. The next prime is 47927183. The reversal of 47927161 is 16172974.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45427600 + 2499561 = 6740^2 + 1581^2 .
It is a cyclic number.
It is not a de Polignac number, because 47927161 - 23 = 47927153 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 47927161.
It is not a weakly prime, because it can be changed into another prime (47927141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 23963580 + 23963581.
It is an arithmetic number, because the mean of its divisors is an integer number (23963581).
Almost surely, 247927161 is an apocalyptic number.
It is an amenable number.
47927161 is a deficient number, since it is larger than the sum of its proper divisors (1).
47927161 is an equidigital number, since it uses as much as digits as its factorization.
47927161 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 21168, while the sum is 37.
The square root of 47927161 is about 6922.9445324948. The cubic root of 47927161 is about 363.2401959926.
The spelling of 47927161 in words is "forty-seven million, nine hundred twenty-seven thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •