Base | Representation |
---|---|
bin | 100010101010111010… |
… | …1011001010110011001 |
3 | 21010011212021201202222 |
4 | 1011111311121112121 |
5 | 2204440323123412 |
6 | 54112014233425 |
7 | 5244023564165 |
oct | 1052565312631 |
9 | 233155251688 |
10 | 74454504857 |
11 | 29637699547 |
12 | 1251a7b5875 |
13 | 7037282345 |
14 | 386447bca5 |
15 | 1e0b714072 |
hex | 1155d59599 |
74454504857 has 2 divisors, whose sum is σ = 74454504858. Its totient is φ = 74454504856.
The previous prime is 74454504829. The next prime is 74454504863. The reversal of 74454504857 is 75840545447.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 60937884736 + 13516620121 = 246856^2 + 116261^2 .
It is an emirp because it is prime and its reverse (75840545447) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 74454504857 - 220 = 74453456281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 74454504799 and 74454504808.
It is not a weakly prime, because it can be changed into another prime (74454504827) 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, 37227252428 + 37227252429.
It is an arithmetic number, because the mean of its divisors is an integer number (37227252429).
Almost surely, 274454504857 is an apocalyptic number.
It is an amenable number.
74454504857 is a deficient number, since it is larger than the sum of its proper divisors (1).
74454504857 is an equidigital number, since it uses as much as digits as its factorization.
74454504857 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12544000, while the sum is 53.
The spelling of 74454504857 in words is "seventy-four billion, four hundred fifty-four million, five hundred four thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •