Base | Representation |
---|---|
bin | 11101110111000110110… |
… | …011000001000011110000 |
3 | 21021011122211020121000111 |
4 | 131313012303001003300 |
5 | 232110031333201030 |
6 | 4210405224231104 |
7 | 301153221560614 |
oct | 35670663010360 |
9 | 7234584217014 |
10 | 2052034662640 |
11 | 721299086006 |
12 | 29184630b494 |
13 | 11b6769c6791 |
14 | 714674dd344 |
15 | 385a12d062a |
hex | 1ddc6cc10f0 |
2052034662640 has 40 divisors (see below), whose sum is σ = 4778069840208. Its totient is φ = 819594209280.
The previous prime is 2052034662589. The next prime is 2052034662701. The reversal of 2052034662640 is 462664302502.
It is a tau number, because it is divible by the number of its divisors (40).
It is a super-2 number, since 2×20520346626402 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (40).
It is a junction number, because it is equal to n+sod(n) for n = 2052034662593 and 2052034662602.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 19002946 + ... + 19110625.
Almost surely, 22052034662640 is an apocalyptic number.
2052034662640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2052034662640 is an abundant number, since it is smaller than the sum of its proper divisors (2726035177568).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2052034662640 is a wasteful number, since it uses less digits than its factorization.
2052034662640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38114257 (or 38114251 counting only the distinct ones).
The product of its (nonzero) digits is 414720, while the sum is 40.
The spelling of 2052034662640 in words is "two trillion, fifty-two billion, thirty-four million, six hundred sixty-two thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.289 sec. • engine limits •