Base | Representation |
---|---|
bin | 111000010011010000101100… |
… | …0001001010110001001001101 |
3 | 2101221110101000211200010101122 |
4 | 1300212201120021112021031 |
5 | 1004402310214303133424 |
6 | 4513132440343250325 |
7 | 206212033054610561 |
oct | 16046413011261115 |
9 | 2357411024603348 |
10 | 495228387942989 |
11 | 1338821a8464218 |
12 | 476626b51499a5 |
13 | 18343ab5018cbc |
14 | 8a4127908b6a1 |
15 | 3c3c06099845e |
hex | 1c2685825624d |
495228387942989 has 2 divisors, whose sum is σ = 495228387942990. Its totient is φ = 495228387942988.
The previous prime is 495228387942983. The next prime is 495228387943043. The reversal of 495228387942989 is 989249783822594.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 397840602267364 + 97387785675625 = 19945942^2 + 9868525^2 .
It is a cyclic number.
It is not a de Polignac number, because 495228387942989 - 220 = 495228386894413 is a prime.
It is a super-2 number, since 2×4952283879429892 (a number of 30 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (495228387942983) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 247614193971494 + 247614193971495.
It is an arithmetic number, because the mean of its divisors is an integer number (247614193971495).
Almost surely, 2495228387942989 is an apocalyptic number.
It is an amenable number.
495228387942989 is a deficient number, since it is larger than the sum of its proper divisors (1).
495228387942989 is an equidigital number, since it uses as much as digits as its factorization.
495228387942989 is an evil number, because the sum of its binary digits is even.
The product of its digits is 45148078080, while the sum is 89.
The spelling of 495228387942989 in words is "four hundred ninety-five trillion, two hundred twenty-eight billion, three hundred eighty-seven million, nine hundred forty-two thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •