Base | Representation |
---|---|
bin | 11101011001011001000… |
… | …010001001000001101100 |
3 | 21011010022012220121121100 |
4 | 131121121002021001230 |
5 | 231044210330100404 |
6 | 4144011213403100 |
7 | 265643443522662 |
oct | 35313102110154 |
9 | 7133265817540 |
10 | 2020128362604 |
11 | 709805883600 |
12 | 287620a99490 |
13 | 1186607033c1 |
14 | 6dabbc2ac32 |
15 | 37835151d39 |
hex | 1d65908906c |
2020128362604 has 108 divisors (see below), whose sum is σ = 5625146457112. Its totient is φ = 610819989120.
The previous prime is 2020128362501. The next prime is 2020128362633. The reversal of 2020128362604 is 4062638210202.
2020128362604 is a `hidden beast` number, since 2 + 0 + 2 + 0 + 1 + 28 + 3 + 626 + 0 + 4 = 666.
It is a Harshad number since it is a multiple of its sum of digits (36).
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1483299 + ... + 2498085.
Almost surely, 22020128362604 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 2020128362604, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2812573228556).
2020128362604 is an abundant number, since it is smaller than the sum of its proper divisors (3605018094508).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2020128362604 is a wasteful number, since it uses less digits than its factorization.
2020128362604 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015276 (or 1015260 counting only the distinct ones).
The product of its (nonzero) digits is 55296, while the sum is 36.
The spelling of 2020128362604 in words is "two trillion, twenty billion, one hundred twenty-eight million, three hundred sixty-two thousand, six hundred four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •