Base | Representation |
---|---|
bin | 110010110000010110… |
… | …101101111000000101 |
3 | 12012200002021011101101 |
4 | 302300112231320011 |
5 | 1343103034241040 |
6 | 41011452500101 |
7 | 3636343232332 |
oct | 626026557005 |
9 | 165602234341 |
10 | 54498352645 |
11 | 21126998a70 |
12 | a68b47a631 |
13 | 51a69ba759 |
14 | 28cdd2b989 |
15 | 163e75a09a |
hex | cb05ade05 |
54498352645 has 8 divisors (see below), whose sum is σ = 71343298080. Its totient is φ = 39635165520.
The previous prime is 54498352619. The next prime is 54498352663. The reversal of 54498352645 is 54625389445.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 54498352645 - 211 = 54498350597 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (55), and also a Moran number because the ratio is a prime number: 990879139 = 54498352645 / (5 + 4 + 4 + 9 + 8 + 3 + 5 + 2 + 6 + 4 + 5).
It is a congruent number.
It is an unprimeable number.
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 7 ways as a sum of consecutive naturals, for example, 495439515 + ... + 495439624.
It is an arithmetic number, because the mean of its divisors is an integer number (8917912260).
Almost surely, 254498352645 is an apocalyptic number.
54498352645 is a gapful number since it is divisible by the number (55) formed by its first and last digit.
It is an amenable number.
54498352645 is a deficient number, since it is larger than the sum of its proper divisors (16844945435).
54498352645 is a wasteful number, since it uses less digits than its factorization.
54498352645 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 990879155.
The product of its digits is 20736000, while the sum is 55.
The spelling of 54498352645 in words is "fifty-four billion, four hundred ninety-eight million, three hundred fifty-two thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •