Base | Representation |
---|---|
bin | 110010010101110000… |
… | …011100100000011100 |
3 | 12011111222120210212100 |
4 | 302111300130200130 |
5 | 1341144320044122 |
6 | 40455312205100 |
7 | 3622314242364 |
oct | 622560344034 |
9 | 164458523770 |
10 | 54052112412 |
11 | 20a18010091 |
12 | a585b39790 |
13 | 513540918c |
14 | 288a96b9a4 |
15 | 16154b0aac |
hex | c95c1c81c |
54052112412 has 36 divisors (see below), whose sum is σ = 142572240720. Its totient is φ = 17234006592.
The previous prime is 54052112393. The next prime is 54052112417. The reversal of 54052112412 is 21421125045.
It is a happy number.
54052112412 is a `hidden beast` number, since 5 + 4 + 0 + 521 + 124 + 12 = 666.
It is a tau number, because it is divible by the number of its divisors (36).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (54052112417) 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, 32639337 + ... + 32640992.
It is an arithmetic number, because the mean of its divisors is an integer number (3960340020).
Almost surely, 254052112412 is an apocalyptic number.
It is an amenable number.
54052112412 is an abundant number, since it is smaller than the sum of its proper divisors (88520128308).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
54052112412 is a wasteful number, since it uses less digits than its factorization.
54052112412 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 65280362 (or 65280357 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 27.
Adding to 54052112412 its reverse (21421125045), we get a palindrome (75473237457).
It can be divided in two parts, 54052 and 112412, that added together give a square (166464 = 4082).
The spelling of 54052112412 in words is "fifty-four billion, fifty-two million, one hundred twelve thousand, four hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •