Base | Representation |
---|---|
bin | 110010110010111011… |
… | …001000010010101001 |
3 | 12012210002100212012201 |
4 | 302302323020102221 |
5 | 1343200102434312 |
6 | 41020032340201 |
7 | 3640405460632 |
oct | 626273102251 |
9 | 165702325181 |
10 | 54541452457 |
11 | 21149256548 |
12 | a6a19a4661 |
13 | 51b28cb1bb |
14 | 28d594a889 |
15 | 1643420557 |
hex | cb2ec84a9 |
54541452457 has 2 divisors, whose sum is σ = 54541452458. Its totient is φ = 54541452456.
The previous prime is 54541452389. The next prime is 54541452463. The reversal of 54541452457 is 75425414545.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 53720114176 + 821338281 = 231776^2 + 28659^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-54541452457 is a prime.
It is a super-2 number, since 2×545414524572 (a number of 22 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (54541452467) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 27270726228 + 27270726229.
It is an arithmetic number, because the mean of its divisors is an integer number (27270726229).
Almost surely, 254541452457 is an apocalyptic number.
It is an amenable number.
54541452457 is a deficient number, since it is larger than the sum of its proper divisors (1).
54541452457 is an equidigital number, since it uses as much as digits as its factorization.
54541452457 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 2240000, while the sum is 46.
It can be divided in two parts, 545414 and 52457, that added together give a triangular number (597871 = T1093).
The spelling of 54541452457 in words is "fifty-four billion, five hundred forty-one million, four hundred fifty-two thousand, four hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •