Base | Representation |
---|---|
bin | 110010101110011100… |
… | …000101010101110101 |
3 | 12012120211202220011112 |
4 | 302232130011111311 |
5 | 1343021322030140 |
6 | 41004343444405 |
7 | 3635503050500 |
oct | 625634052565 |
9 | 165524686145 |
10 | 54466205045 |
11 | 2110a830aaa |
12 | a680756705 |
13 | 51a01430c5 |
14 | 28c9960137 |
15 | 163ba09c65 |
hex | cae705575 |
54466205045 has 12 divisors (see below), whose sum is σ = 76030376364. Its totient is φ = 37348254720.
The previous prime is 54466205041. The next prime is 54466205071. The reversal of 54466205045 is 54050266445.
It can be written as a sum of positive squares in 2 ways, for example, as 13826467396 + 40639737649 = 117586^2 + 201593^2 .
It is not a de Polignac number, because 54466205045 - 22 = 54466205041 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54466204993 and 54466205011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54466205041) 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 11 ways as a sum of consecutive naturals, for example, 111155276 + ... + 111155765.
It is an arithmetic number, because the mean of its divisors is an integer number (6335864697).
Almost surely, 254466205045 is an apocalyptic number.
It is an amenable number.
54466205045 is a deficient number, since it is larger than the sum of its proper divisors (21564171319).
54466205045 is a wasteful number, since it uses less digits than its factorization.
54466205045 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 222311060 (or 222311053 counting only the distinct ones).
The product of its (nonzero) digits is 576000, while the sum is 41.
The spelling of 54466205045 in words is "fifty-four billion, four hundred sixty-six million, two hundred five thousand, forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •