Base | Representation |
---|---|
bin | 110010010101111000… |
… | …111101001111011001 |
3 | 12011112010210011112110 |
4 | 302111320331033121 |
5 | 1341200402444031 |
6 | 40455432102533 |
7 | 3622342224414 |
oct | 622570751731 |
9 | 164463704473 |
10 | 54054343641 |
11 | 20a192a4481 |
12 | a586834a49 |
13 | 5135a0a92c |
14 | 288ad8cb7b |
15 | 16157a1c46 |
hex | c95e3d3d9 |
54054343641 has 32 divisors (see below), whose sum is σ = 77622710400. Its totient is φ = 33334778880.
The previous prime is 54054343633. The next prime is 54054343649. The reversal of 54054343641 is 14634345045.
It is an interprime number because it is at equal distance from previous prime (54054343633) and next prime (54054343649).
It is not a de Polignac number, because 54054343641 - 23 = 54054343633 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 54054343641.
It is not an unprimeable number, because it can be changed into a prime (54054343649) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 4532995 + ... + 4544903.
It is an arithmetic number, because the mean of its divisors is an integer number (2425709700).
Almost surely, 254054343641 is an apocalyptic number.
54054343641 is a gapful number since it is divisible by the number (51) formed by its first and last digit.
It is an amenable number.
54054343641 is a deficient number, since it is larger than the sum of its proper divisors (23568366759).
54054343641 is a wasteful number, since it uses less digits than its factorization.
54054343641 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13449.
The product of its (nonzero) digits is 345600, while the sum is 39.
Adding to 54054343641 its reverse (14634345045), we get a palindrome (68688688686).
The spelling of 54054343641 in words is "fifty-four billion, fifty-four million, three hundred forty-three thousand, six hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •