Base | Representation |
---|---|
bin | 11010001101010111110011… |
… | …01011110000000000000000 |
3 | 21120001202120202012101002210 |
4 | 31012223321223300000000 |
5 | 30023234023401021222 |
6 | 322324415520542120 |
7 | 15065631511300230 |
oct | 1506537153600000 |
9 | 246052522171083 |
10 | 57634060173312 |
11 | 174005164a6297 |
12 | 6569a4a181940 |
13 | 2620b3a2a03bc |
14 | 1033709467cc0 |
15 | 69e2da4b4d0c |
hex | 346af9af0000 |
57634060173312 has 272 divisors, whose sum is σ = 176616498985472. Its totient is φ = 16375826350080.
The previous prime is 57634060173259. The next prime is 57634060173329. The reversal of 57634060173312 is 21337106043675.
It is a Harshad number since it is a multiple of its sum of digits (48).
It is a congruent number.
It is an unprimeable number.
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 15 ways as a sum of consecutive naturals, for example, 248986653 + ... + 249218019.
Almost surely, 257634060173312 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57634060173312, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (88308249492736).
57634060173312 is an abundant number, since it is smaller than the sum of its proper divisors (118982438812160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57634060173312 is an equidigital number, since it uses as much as digits as its factorization.
57634060173312 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 231590 (or 231560 counting only the distinct ones).
The product of its (nonzero) digits is 1905120, while the sum is 48.
The spelling of 57634060173312 in words is "fifty-seven trillion, six hundred thirty-four billion, sixty million, one hundred seventy-three thousand, three hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.339 sec. • engine limits •