Base | Representation |
---|---|
bin | 1001010001101111011000… |
… | …01101011111111000011100 |
3 | 2200020021221020002111222001 |
4 | 10220313230031133320130 |
5 | 10133221230214301030 |
6 | 111215551520332044 |
7 | 4203622626236455 |
oct | 450675415377034 |
9 | 80207836074861 |
10 | 20400762650140 |
11 | 6555a0773a804 |
12 | 235597a174024 |
13 | b4ca25928742 |
14 | 50758b82612c |
15 | 255a0d6c9cca |
hex | 128dec35fe1c |
20400762650140 has 24 divisors (see below), whose sum is σ = 42866817411600. Its totient is φ = 8155502041728.
The previous prime is 20400762650069. The next prime is 20400762650197. The reversal of 20400762650140 is 4105626700402.
It is a super-2 number, since 2×204007626501402 (a number of 27 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 20400762650140.
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, 300153817 + ... + 300221776.
It is an arithmetic number, because the mean of its divisors is an integer number (1786117392150).
Almost surely, 220400762650140 is an apocalyptic number.
20400762650140 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20400762650140 is an abundant number, since it is smaller than the sum of its proper divisors (22466054761460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20400762650140 is a wasteful number, since it uses less digits than its factorization.
20400762650140 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 600377301 (or 600377299 counting only the distinct ones).
The product of its (nonzero) digits is 80640, while the sum is 37.
The spelling of 20400762650140 in words is "twenty trillion, four hundred billion, seven hundred sixty-two million, six hundred fifty thousand, one hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •