Base | Representation |
---|---|
bin | 110011000110101001… |
… | …011000100111100101 |
3 | 12020122010222221112100 |
4 | 303012221120213211 |
5 | 1344334310020221 |
6 | 41112532442313 |
7 | 3651534144252 |
oct | 630651304745 |
9 | 166563887470 |
10 | 54872345061 |
11 | 212a9010006 |
12 | a774779399 |
13 | 5236324341 |
14 | 2927882429 |
15 | 16624d2926 |
hex | cc6a589e5 |
54872345061 has 12 divisors (see below), whose sum is σ = 81402218092. Its totient is φ = 35592872256.
The previous prime is 54872345029. The next prime is 54872345083. The reversal of 54872345061 is 16054327845.
54872345061 is a `hidden beast` number, since 5 + 48 + 72 + 34 + 506 + 1 = 666.
54872345061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 2 ways, for example, as 31281228225 + 23591116836 = 176865^2 + 153594^2 .
It is not a de Polignac number, because 54872345061 - 25 = 54872345029 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 54872344998 and 54872345016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54872345261) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 82390576 + ... + 82391241.
Almost surely, 254872345061 is an apocalyptic number.
It is an amenable number.
54872345061 is a deficient number, since it is larger than the sum of its proper divisors (26529873031).
54872345061 is a wasteful number, since it uses less digits than its factorization.
54872345061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 164781860 (or 164781857 counting only the distinct ones).
The product of its (nonzero) digits is 806400, while the sum is 45.
The spelling of 54872345061 in words is "fifty-four billion, eight hundred seventy-two million, three hundred forty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •