Base | Representation |
---|---|
bin | 1011010001001… |
… | …0111011100001 |
3 | 10021221020021102 |
4 | 2310102323201 |
5 | 44044412312 |
6 | 4405004145 |
7 | 1112506223 |
oct | 264227341 |
9 | 107836242 |
10 | 47263457 |
11 | 2475180a |
12 | 139b3655 |
13 | 9a3a957 |
14 | 63c4413 |
15 | 4238ec2 |
hex | 2d12ee1 |
47263457 has 2 divisors, whose sum is σ = 47263458. Its totient is φ = 47263456.
The previous prime is 47263441. The next prime is 47263549. The reversal of 47263457 is 75436274.
47263457 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 26460736 + 20802721 = 5144^2 + 4561^2 .
It is a cyclic number.
It is not a de Polignac number, because 47263457 - 24 = 47263441 is a prime.
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 47263457.
It is not a weakly prime, because it can be changed into another prime (47260457) 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, 23631728 + 23631729.
It is an arithmetic number, because the mean of its divisors is an integer number (23631729).
Almost surely, 247263457 is an apocalyptic number.
It is an amenable number.
47263457 is a deficient number, since it is larger than the sum of its proper divisors (1).
47263457 is an equidigital number, since it uses as much as digits as its factorization.
47263457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 141120, while the sum is 38.
The square root of 47263457 is about 6874.8423254646. The cubic root of 47263457 is about 361.5556573045. Note that the first 3 decimals are identical.
The spelling of 47263457 in words is "forty-seven million, two hundred sixty-three thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •