Base | Representation |
---|---|
bin | 1110010001001010100… |
… | …10101001100001101111 |
3 | 1201212102111110210212002 |
4 | 13020211102221201233 |
5 | 31013013442324143 |
6 | 1013115120002515 |
7 | 50263620353462 |
oct | 7104522514157 |
9 | 1655374423762 |
10 | 490251917423 |
11 | 179a07476804 |
12 | 7b02046043b |
13 | 372cc6c4988 |
14 | 19a2a7192d9 |
15 | cb44e375b8 |
hex | 72254a986f |
490251917423 has 2 divisors, whose sum is σ = 490251917424. Its totient is φ = 490251917422.
The previous prime is 490251917327. The next prime is 490251917429. The reversal of 490251917423 is 324719152094.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 490251917423 - 218 = 490251655279 is a prime.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (490251917429) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 245125958711 + 245125958712.
It is an arithmetic number, because the mean of its divisors is an integer number (245125958712).
Almost surely, 2490251917423 is an apocalyptic number.
490251917423 is a deficient number, since it is larger than the sum of its proper divisors (1).
490251917423 is an equidigital number, since it uses as much as digits as its factorization.
490251917423 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 544320, while the sum is 47.
The spelling of 490251917423 in words is "four hundred ninety billion, two hundred fifty-one million, nine hundred seventeen thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •