Base | Representation |
---|---|
bin | 1110010000001010110… |
… | …01111111110111110111 |
3 | 1201211001012212211010102 |
4 | 13020011121333313313 |
5 | 31010420021114142 |
6 | 1012550050144315 |
7 | 50244433406051 |
oct | 7100531776767 |
9 | 1654035784112 |
10 | 489716973047 |
11 | 179762512115 |
12 | 7aab128209b |
13 | 37245926243 |
14 | 199b96688d1 |
15 | cb12eba532 |
hex | 720567fdf7 |
489716973047 has 2 divisors, whose sum is σ = 489716973048. Its totient is φ = 489716973046.
The previous prime is 489716972993. The next prime is 489716973059. The reversal of 489716973047 is 740379617984.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 489716973047 - 210 = 489716972023 is a prime.
It is a super-2 number, since 2×4897169730472 (a number of 24 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (489716973947) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 244858486523 + 244858486524.
It is an arithmetic number, because the mean of its divisors is an integer number (244858486524).
Almost surely, 2489716973047 is an apocalyptic number.
489716973047 is a deficient number, since it is larger than the sum of its proper divisors (1).
489716973047 is an equidigital number, since it uses as much as digits as its factorization.
489716973047 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64012032, while the sum is 65.
The spelling of 489716973047 in words is "four hundred eighty-nine billion, seven hundred sixteen million, nine hundred seventy-three thousand, forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •