Base | Representation |
---|---|
bin | 101100000101000001… |
… | …000101000110011001 |
3 | 11112011102111121221112 |
4 | 230011001011012121 |
5 | 1233412133344434 |
6 | 33424220350105 |
7 | 3263565145652 |
oct | 540501050631 |
9 | 145142447845 |
10 | 47328809369 |
11 | 19087973a96 |
12 | 920a3a5335 |
13 | 460353235a |
14 | 240da7a529 |
15 | 1370100dce |
hex | b05045199 |
47328809369 has 2 divisors, whose sum is σ = 47328809370. Its totient is φ = 47328809368.
The previous prime is 47328809357. The next prime is 47328809371. The reversal of 47328809369 is 96390882374.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 25150153744 + 22178655625 = 158588^2 + 148925^2 .
It is a cyclic number.
It is not a de Polignac number, because 47328809369 - 28 = 47328809113 is a prime.
It is a super-2 number, since 2×473288093692 (a number of 22 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 47328809371, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (47328809329) 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, 23664404684 + 23664404685.
It is an arithmetic number, because the mean of its divisors is an integer number (23664404685).
Almost surely, 247328809369 is an apocalyptic number.
It is an amenable number.
47328809369 is a deficient number, since it is larger than the sum of its proper divisors (1).
47328809369 is an equidigital number, since it uses as much as digits as its factorization.
47328809369 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15676416, while the sum is 59.
The spelling of 47328809369 in words is "forty-seven billion, three hundred twenty-eight million, eight hundred nine thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •