Base | Representation |
---|---|
bin | 110101000110110110… |
… | …111000010100000000 |
3 | 12110012001112011002100 |
4 | 311012312320110000 |
5 | 1413240440211100 |
6 | 42110212350400 |
7 | 4056043421430 |
oct | 650666702400 |
9 | 173161464070 |
10 | 57023366400 |
11 | 222022271a0 |
12 | b075015400 |
13 | 54b9b67430 |
14 | 2a8d4102c0 |
15 | 173b277400 |
hex | d46db8500 |
57023366400 has 2592 divisors, whose sum is σ = 292273293312. Its totient is φ = 10218700800.
The previous prime is 57023366359. The next prime is 57023366419. The reversal of 57023366400 is 466332075.
57023366400 is a `hidden beast` number, since 5 + 7 + 0 + 2 + 3 + 3 + 6 + 640 + 0 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 1326124779 + ... + 1326124821.
Almost surely, 257023366400 is an apocalyptic number.
57023366400 is a gapful number since it is divisible by the number (50) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 57023366400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (146136646656).
57023366400 is an abundant number, since it is smaller than the sum of its proper divisors (235249926912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57023366400 is a wasteful number, since it uses less digits than its factorization.
57023366400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 129 (or 107 counting only the distinct ones).
The product of its (nonzero) digits is 90720, while the sum is 36.
Adding to 57023366400 its reverse (466332075), we get a palindrome (57489698475).
The spelling of 57023366400 in words is "fifty-seven billion, twenty-three million, three hundred sixty-six thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •