Base | Representation |
---|---|
bin | 110010011001010010… |
… | …000011100110111001 |
3 | 12011200002212120012102 |
4 | 302121102003212321 |
5 | 1341304440124334 |
6 | 40505223553145 |
7 | 3623633035562 |
oct | 623122034671 |
9 | 164602776172 |
10 | 54111254969 |
11 | 20a48435832 |
12 | a5a18bb7b5 |
13 | 5144745a85 |
14 | 2894765169 |
15 | 161a79467e |
hex | c994839b9 |
54111254969 has 4 divisors (see below), whose sum is σ = 54160582644. Its totient is φ = 54061927296.
The previous prime is 54111254929. The next prime is 54111255001. The reversal of 54111254969 is 96945211145.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 25689678400 + 28421576569 = 160280^2 + 168587^2 .
It is a cyclic number.
It is not a de Polignac number, because 54111254969 - 28 = 54111254713 is a prime.
It is a super-2 number, since 2×541112549692 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (54111254929) 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 in 3 ways as a sum of consecutive naturals, for example, 24662192 + ... + 24664385.
It is an arithmetic number, because the mean of its divisors is an integer number (13540145661).
Almost surely, 254111254969 is an apocalyptic number.
It is an amenable number.
54111254969 is a deficient number, since it is larger than the sum of its proper divisors (49327675).
54111254969 is a wasteful number, since it uses less digits than its factorization.
54111254969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 49327674.
The product of its digits is 388800, while the sum is 47.
The spelling of 54111254969 in words is "fifty-four billion, one hundred eleven million, two hundred fifty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •