Base | Representation |
---|---|
bin | 11101111000001111010… |
… | …011000110001111110100 |
3 | 21021021210121001120011110 |
4 | 131320033103012033310 |
5 | 232120024231011202 |
6 | 4211130035235020 |
7 | 301225321544253 |
oct | 35701723061764 |
9 | 7237717046143 |
10 | 2053251032052 |
11 | 721862752390 |
12 | 291b25748a70 |
13 | 11b80b9cc9ac |
14 | 71540c9079a |
15 | 38622ea126c |
hex | 1de0f4c63f4 |
2053251032052 has 48 divisors (see below), whose sum is σ = 5231136560832. Its totient is φ = 621640212480.
The previous prime is 2053251032051. The next prime is 2053251032057. The reversal of 2053251032052 is 2502301523502.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2053251032051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 6815373 + ... + 7110260.
It is an arithmetic number, because the mean of its divisors is an integer number (108982011684).
Almost surely, 22053251032052 is an apocalyptic number.
2053251032052 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2053251032052 is an abundant number, since it is smaller than the sum of its proper divisors (3177885528780).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2053251032052 is a wasteful number, since it uses less digits than its factorization.
2053251032052 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13926768 (or 13926766 counting only the distinct ones).
The product of its (nonzero) digits is 18000, while the sum is 30.
Adding to 2053251032052 its reverse (2502301523502), we get a palindrome (4555552555554).
The spelling of 2053251032052 in words is "two trillion, fifty-three billion, two hundred fifty-one million, thirty-two thousand, fifty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •