Base | Representation |
---|---|
bin | 111101001101001… |
… | …1110111010001100 |
3 | 12022010111221210012 |
4 | 1322122132322030 |
5 | 13201230401300 |
6 | 535443132352 |
7 | 101615460233 |
oct | 17232367214 |
9 | 5263457705 |
10 | 2053762700 |
11 | 964328350 |
12 | 4939740b8 |
13 | 26964c302 |
14 | 156a91b1a |
15 | c0482435 |
hex | 7a69ee8c |
2053762700 has 72 divisors (see below), whose sum is σ = 4993315824. Its totient is φ = 726624000.
The previous prime is 2053762661. The next prime is 2053762709. The reversal of 2053762700 is 72673502.
It is a happy number.
It is a super-2 number, since 2×20537627002 = 8435882455822580000, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (2053762709) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 15470 + ... + 65930.
Almost surely, 22053762700 is an apocalyptic number.
2053762700 is a gapful number since it is divisible by the number (20) 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 2053762700, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2496657912).
2053762700 is an abundant number, since it is smaller than the sum of its proper divisors (2939553124).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2053762700 is a wasteful number, since it uses less digits than its factorization.
2053762700 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 50523 (or 50516 counting only the distinct ones).
The product of its (nonzero) digits is 17640, while the sum is 32.
The square root of 2053762700 is about 45318.4587116552. The cubic root of 2053762700 is about 1271.1108349894.
The spelling of 2053762700 in words is "two billion, fifty-three million, seven hundred sixty-two thousand, seven hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •