Base | Representation |
---|---|
bin | 1011010000011… |
… | …1100001011011 |
3 | 10021211212011211 |
4 | 2310013201123 |
5 | 44041413411 |
6 | 4404003551 |
7 | 1112223052 |
oct | 264074133 |
9 | 107755154 |
10 | 47216731 |
11 | 2471a6a1 |
12 | 139905b7 |
13 | 9a225c3 |
14 | 63b1399 |
15 | 422a221 |
hex | 2d0785b |
47216731 has 2 divisors, whose sum is σ = 47216732. Its totient is φ = 47216730.
The previous prime is 47216713. The next prime is 47216747. The reversal of 47216731 is 13761274.
47216731 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
Together with previous prime (47216713) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 47216731 - 215 = 47183963 is a prime.
It is a super-2 number, since 2×472167312 = 4458839372652722, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 47216693 and 47216702.
It is not a weakly prime, because it can be changed into another prime (47216761) 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, 23608365 + 23608366.
It is an arithmetic number, because the mean of its divisors is an integer number (23608366).
Almost surely, 247216731 is an apocalyptic number.
47216731 is a deficient number, since it is larger than the sum of its proper divisors (1).
47216731 is an equidigital number, since it uses as much as digits as its factorization.
47216731 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 7056, while the sum is 31.
The square root of 47216731 is about 6871.4431526427. The cubic root of 47216731 is about 361.4364699443.
The spelling of 47216731 in words is "forty-seven million, two hundred sixteen thousand, seven hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •