Base | Representation |
---|---|
bin | 1011011010111… |
… | …1000000110001 |
3 | 10100010201020122 |
4 | 2312233000301 |
5 | 44230342034 |
6 | 4430420025 |
7 | 1121111135 |
oct | 266570061 |
9 | 110121218 |
10 | 47902769 |
11 | 25049072 |
12 | 14061615 |
13 | 9c02945 |
14 | 650d3c5 |
15 | 431362e |
hex | 2daf031 |
47902769 has 2 divisors, whose sum is σ = 47902770. Its totient is φ = 47902768.
The previous prime is 47902763. The next prime is 47902783. The reversal of 47902769 is 96720974.
47902769 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., 37662769 + 10240000 = 6137^2 + 3200^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-47902769 is a prime.
It is a super-2 number, since 2×479027692 = 4589350555734722, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (47902763) 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, 23951384 + 23951385.
It is an arithmetic number, because the mean of its divisors is an integer number (23951385).
Almost surely, 247902769 is an apocalyptic number.
It is an amenable number.
47902769 is a deficient number, since it is larger than the sum of its proper divisors (1).
47902769 is an equidigital number, since it uses as much as digits as its factorization.
47902769 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 190512, while the sum is 44.
The square root of 47902769 is about 6921.1826301579. The cubic root of 47902769 is about 363.1785631718.
The spelling of 47902769 in words is "forty-seven million, nine hundred two thousand, seven hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •