Base | Representation |
---|---|
bin | 1011010001010… |
… | …0110101010101 |
3 | 10021221121222011 |
4 | 2310110311111 |
5 | 44100140003 |
6 | 4405104221 |
7 | 1112541031 |
oct | 264246525 |
9 | 107847864 |
10 | 47271253 |
11 | 24757657 |
12 | 139b8071 |
13 | 9a41373 |
14 | 63c71c1 |
15 | 423b46d |
hex | 2d14d55 |
47271253 has 2 divisors, whose sum is σ = 47271254. Its totient is φ = 47271252.
The previous prime is 47271251. The next prime is 47271281. The reversal of 47271253 is 35217274.
47271253 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., 47238129 + 33124 = 6873^2 + 182^2 .
It is a cyclic number.
It is not a de Polignac number, because 47271253 - 21 = 47271251 is a prime.
Together with 47271251, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (47271251) 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, 23635626 + 23635627.
It is an arithmetic number, because the mean of its divisors is an integer number (23635627).
Almost surely, 247271253 is an apocalyptic number.
It is an amenable number.
47271253 is a deficient number, since it is larger than the sum of its proper divisors (1).
47271253 is an equidigital number, since it uses as much as digits as its factorization.
47271253 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 11760, while the sum is 31.
The square root of 47271253 is about 6875.4092969073. The cubic root of 47271253 is about 361.5755354734.
It can be divided in two parts, 47271 and 253, that added together give a square (47524 = 2182).
The spelling of 47271253 in words is "forty-seven million, two hundred seventy-one thousand, two hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.028 sec. • engine limits •