Base | Representation |
---|---|
bin | 110101000101100000… |
… | …011010010011000000 |
3 | 12110010110212112100200 |
4 | 311011200122103000 |
5 | 1413214134332242 |
6 | 42104042445200 |
7 | 4055346643062 |
oct | 650540322300 |
9 | 173113775320 |
10 | 57000699072 |
11 | 221a0454969 |
12 | b069503800 |
13 | 54b525bc05 |
14 | 2a8a3cd732 |
15 | 173929b04c |
hex | d4581a4c0 |
57000699072 has 168 divisors, whose sum is σ = 170651850720. Its totient is φ = 18156441600.
The previous prime is 57000699061. The next prime is 57000699097. The reversal of 57000699072 is 27099600075.
57000699072 is a `hidden beast` number, since 570 + 0 + 0 + 6 + 9 + 9 + 0 + 72 = 666.
It is a super-2 number, since 2×570006990722 (a number of 22 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 23858454 + ... + 23860842.
Almost surely, 257000699072 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 57000699072, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (85325925360).
57000699072 is an abundant number, since it is smaller than the sum of its proper divisors (113651151648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57000699072 is a wasteful number, since it uses less digits than its factorization.
57000699072 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4231 (or 4218 counting only the distinct ones).
The product of its (nonzero) digits is 238140, while the sum is 45.
The spelling of 57000699072 in words is "fifty-seven billion, six hundred ninety-nine thousand, seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •