Base | Representation |
---|---|
bin | 110010110000110000… |
… | …011111101001110101 |
3 | 12012200112222110220201 |
4 | 302300300133221311 |
5 | 1343111302011013 |
6 | 41012253400501 |
7 | 3636454535425 |
oct | 626060375165 |
9 | 165615873821 |
10 | 54505110133 |
11 | 2112a793a71 |
12 | a691799131 |
13 | 51a8215476 |
14 | 28d0baa485 |
15 | 16401423dd |
hex | cb0c1fa75 |
54505110133 has 24 divisors (see below), whose sum is σ = 61413311520. Its totient is φ = 48227362560.
The previous prime is 54505110113. The next prime is 54505110151. The reversal of 54505110133 is 33101150545.
It is not a de Polignac number, because 54505110133 - 29 = 54505109621 is a prime.
It is a super-2 number, since 2×545051101332 (a number of 22 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54505110113) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 681435 + ... + 757207.
It is an arithmetic number, because the mean of its divisors is an integer number (2558887980).
Almost surely, 254505110133 is an apocalyptic number.
It is an amenable number.
54505110133 is a deficient number, since it is larger than the sum of its proper divisors (6908201387).
54505110133 is a wasteful number, since it uses less digits than its factorization.
54505110133 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 75957 (or 75940 counting only the distinct ones).
The product of its (nonzero) digits is 4500, while the sum is 28.
Adding to 54505110133 its reverse (33101150545), we get a palindrome (87606260678).
The spelling of 54505110133 in words is "fifty-four billion, five hundred five million, one hundred ten thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •