Base | Representation |
---|---|
bin | 101110001010011000… |
… | …000000101101101111 |
3 | 11201221100112100210101 |
4 | 232022120000231233 |
5 | 1303002421043242 |
6 | 34434223251531 |
7 | 3403203444604 |
oct | 561230005557 |
9 | 151840470711 |
10 | 49566190447 |
11 | 1a025905564 |
12 | 9733749ba7 |
13 | 489bc21497 |
14 | 2582c886ab |
15 | 14517539b7 |
hex | b8a600b6f |
49566190447 has 2 divisors, whose sum is σ = 49566190448. Its totient is φ = 49566190446.
The previous prime is 49566190381. The next prime is 49566190451. The reversal of 49566190447 is 74409166594.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 49566190447 - 227 = 49431972719 is a prime.
It is a super-3 number, since 3×495661904473 (a number of 33 digits) contains 333 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (49566190477) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 24783095223 + 24783095224.
It is an arithmetic number, because the mean of its divisors is an integer number (24783095224).
Almost surely, 249566190447 is an apocalyptic number.
49566190447 is a deficient number, since it is larger than the sum of its proper divisors (1).
49566190447 is an equidigital number, since it uses as much as digits as its factorization.
49566190447 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6531840, while the sum is 55.
The spelling of 49566190447 in words is "forty-nine billion, five hundred sixty-six million, one hundred ninety thousand, four hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •