Base | Representation |
---|---|
bin | 111010100000111101101… |
… | …0111000101101110100001 |
3 | 1001110211110010020221100112 |
4 | 1311001323113011232201 |
5 | 2023231011044202244 |
6 | 25034320302301105 |
7 | 1460014261510064 |
oct | 165017327055641 |
9 | 31424403227315 |
10 | 8042248428449 |
11 | 2620775638904 |
12 | a9a784887795 |
13 | 4644c4733051 |
14 | 1db3656d28db |
15 | de2e603339e |
hex | 7507b5c5ba1 |
8042248428449 has 2 divisors, whose sum is σ = 8042248428450. Its totient is φ = 8042248428448.
The previous prime is 8042248428419. The next prime is 8042248428479. The reversal of 8042248428449 is 9448248422408.
It is a happy number.
It is a balanced prime because it is at equal distance from previous prime (8042248428419) and next prime (8042248428479).
It can be written as a sum of positive squares in only one way, i.e., 4546724613025 + 3495523815424 = 2132305^2 + 1869632^2 .
It is a cyclic number.
It is not a de Polignac number, because 8042248428449 - 228 = 8041979992993 is a prime.
It is not a weakly prime, because it can be changed into another prime (8042248428419) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 4021124214224 + 4021124214225.
It is an arithmetic number, because the mean of its divisors is an integer number (4021124214225).
Almost surely, 28042248428449 is an apocalyptic number.
It is an amenable number.
8042248428449 is a deficient number, since it is larger than the sum of its proper divisors (1).
8042248428449 is an equidigital number, since it uses as much as digits as its factorization.
8042248428449 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 37748736, while the sum is 59.
The spelling of 8042248428449 in words is "eight trillion, forty-two billion, two hundred forty-eight million, four hundred twenty-eight thousand, four hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •