Base | Representation |
---|---|
bin | 110010010100000011… |
… | …001000100011001001 |
3 | 12011102222122221222122 |
4 | 302110003020203021 |
5 | 1341120001110334 |
6 | 40452410101025 |
7 | 3621515543666 |
oct | 622403104311 |
9 | 164388587878 |
10 | 54023456969 |
11 | 20a029188a9 |
12 | a57841a775 |
13 | 512c4b51b1 |
14 | 2886c2ca6d |
15 | 1612c0032e |
hex | c940c88c9 |
54023456969 has 2 divisors, whose sum is σ = 54023456970. Its totient is φ = 54023456968.
The previous prime is 54023456959. The next prime is 54023457043. The reversal of 54023456969 is 96965432045.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 45448696969 + 8574760000 = 213187^2 + 92600^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54023456969 is a prime.
It is a super-2 number, since 2×540234569692 (a number of 22 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 54023456969.
It is not a weakly prime, because it can be changed into another prime (54023456959) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27011728484 + 27011728485.
It is an arithmetic number, because the mean of its divisors is an integer number (27011728485).
Almost surely, 254023456969 is an apocalyptic number.
It is an amenable number.
54023456969 is a deficient number, since it is larger than the sum of its proper divisors (1).
54023456969 is an equidigital number, since it uses as much as digits as its factorization.
54023456969 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6998400, while the sum is 53.
The spelling of 54023456969 in words is "fifty-four billion, twenty-three million, four hundred fifty-six thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •