Base | Representation |
---|---|
bin | 110111101011101001110011… |
… | …1111110100101100101010101 |
3 | 2101020011222010121200010210121 |
4 | 1233113103213332211211111 |
5 | 1003144113213310313141 |
6 | 4453404004534551541 |
7 | 205110532333104406 |
oct | 15727234776454525 |
9 | 2336158117603717 |
10 | 489784782510421 |
11 | 132073618078492 |
12 | 46b236a48085b1 |
13 | 1803a6786013c8 |
14 | 88d39d21ad9ad |
15 | 3b9565d5b01d1 |
hex | 1bd74e7fa5955 |
489784782510421 has 2 divisors, whose sum is σ = 489784782510422. Its totient is φ = 489784782510420.
The previous prime is 489784782510307. The next prime is 489784782510433. The reversal of 489784782510421 is 124015287487984.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 484610472376900 + 5174310133521 = 22013870^2 + 2274711^2 .
It is a cyclic number.
It is not a de Polignac number, because 489784782510421 - 213 = 489784782502229 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (489784782510451) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 244892391255210 + 244892391255211.
It is an arithmetic number, because the mean of its divisors is an integer number (244892391255211).
Almost surely, 2489784782510421 is an apocalyptic number.
It is an amenable number.
489784782510421 is a deficient number, since it is larger than the sum of its proper divisors (1).
489784782510421 is an equidigital number, since it uses as much as digits as its factorization.
489784782510421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 289013760, while the sum is 70.
The spelling of 489784782510421 in words is "four hundred eighty-nine trillion, seven hundred eighty-four billion, seven hundred eighty-two million, five hundred ten thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •