Base | Representation |
---|---|
bin | 11001111100001111010000… |
… | …01101101000011001100000 |
3 | 21110222111000222110111020120 |
4 | 30332013220031220121200 |
5 | 24434112342233430012 |
6 | 321154135223040240 |
7 | 15005251054105260 |
oct | 1476075015503140 |
9 | 243874028414216 |
10 | 57045356545632 |
11 | 171a3888667494 |
12 | 64939325a0080 |
13 | 25aa47aa98090 |
14 | 101301d5a17a0 |
15 | 68dd3222a58c |
hex | 33e1e8368660 |
57045356545632 has 96 divisors (see below), whose sum is σ = 184300382714112. Its totient is φ = 15044929196544.
The previous prime is 57045356545613. The next prime is 57045356545637. The reversal of 57045356545632 is 23654565354075.
It is a tau number, because it is divible by the number of its divisors (96).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (57045356545637) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 3264949858 + ... + 3264967329.
It is an arithmetic number, because the mean of its divisors is an integer number (1919795653272).
Almost surely, 257045356545632 is an apocalyptic number.
57045356545632 is a gapful number since it is divisible by the number (52) formed by its first and last digit.
It is an amenable number.
57045356545632 is an abundant number, since it is smaller than the sum of its proper divisors (127255026168480).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57045356545632 is a wasteful number, since it uses less digits than its factorization.
57045356545632 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6529917220 (or 6529917212 counting only the distinct ones).
The product of its (nonzero) digits is 226800000, while the sum is 60.
The spelling of 57045356545632 in words is "fifty-seven trillion, forty-five billion, three hundred fifty-six million, five hundred forty-five thousand, six hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •