Base | Representation |
---|---|
bin | 110010110001000111… |
… | …100001000000101101 |
3 | 12012200222100002012111 |
4 | 302301013201000231 |
5 | 1343114323120010 |
6 | 41013031004021 |
7 | 3636560042002 |
oct | 626107410055 |
9 | 165628302174 |
10 | 54511145005 |
11 | 21133136069 |
12 | a693809611 |
13 | 51a95492b5 |
14 | 28d18db8a9 |
15 | 164093558a |
hex | cb11e102d |
54511145005 has 4 divisors (see below), whose sum is σ = 65413374012. Its totient is φ = 43608916000.
The previous prime is 54511144979. The next prime is 54511145033. The reversal of 54511145005 is 50054111545.
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 7757029476 + 46754115529 = 88074^2 + 216227^2 .
It is not a de Polignac number, because 54511145005 - 229 = 53974274093 is a prime.
It is a super-2 number, since 2×545111450052 (a number of 22 digits) contains 22 as substring.
It is a Smith number, since the sum of its digits (31) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5451114496 + ... + 5451114505.
It is an arithmetic number, because the mean of its divisors is an integer number (16353343503).
Almost surely, 254511145005 is an apocalyptic number.
It is an amenable number.
54511145005 is a deficient number, since it is larger than the sum of its proper divisors (10902229007).
54511145005 is a wasteful number, since it uses less digits than its factorization.
54511145005 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10902229006.
The product of its (nonzero) digits is 10000, while the sum is 31.
The spelling of 54511145005 in words is "fifty-four billion, five hundred eleven million, one hundred forty-five thousand, five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •