Base | Representation |
---|---|
bin | 110101000110101100… |
… | …100110000100101100 |
3 | 12110011212110011200000 |
4 | 311012230212010230 |
5 | 1413234242422002 |
6 | 42110034504300 |
7 | 4056011462100 |
oct | 650654460454 |
9 | 173155404600 |
10 | 57020670252 |
11 | 22200755577 |
12 | b074135090 |
13 | 54b9432190 |
14 | 2a8cd0b900 |
15 | 173ade361c |
hex | d46b2612c |
57020670252 has 864 divisors, whose sum is σ = 203981057280. Its totient is φ = 13756055040.
The previous prime is 57020670251. The next prime is 57020670277. The reversal of 57020670252 is 25207602075.
57020670252 is a `hidden beast` number, since 570 + 2 + 0 + 67 + 0 + 25 + 2 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is not an unprimeable number, because it can be changed into a prime (57020670251) by changing a digit.
It is a polite number, since it can be written in 287 ways as a sum of consecutive naturals, for example, 435272227 + ... + 435272357.
Almost surely, 257020670252 is an apocalyptic number.
57020670252 is a gapful number since it is divisible by the number (52) 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 57020670252, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (101990528640).
57020670252 is an abundant number, since it is smaller than the sum of its proper divisors (146960387028).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
57020670252 is a wasteful number, since it uses less digits than its factorization.
57020670252 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 233 (or 212 counting only the distinct ones).
The product of its (nonzero) digits is 58800, while the sum is 36.
The spelling of 57020670252 in words is "fifty-seven billion, twenty million, six hundred seventy thousand, two hundred fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.100 sec. • engine limits •