Base | Representation |
---|---|
bin | 10010111111111100… |
… | …101000110000011100 |
3 | 1221122201121012022012 |
4 | 102333330220300130 |
5 | 313234423304040 |
6 | 13212143210352 |
7 | 1321351643465 |
oct | 227774506034 |
9 | 57581535265 |
10 | 20400213020 |
11 | 871942aa90 |
12 | 3b53ba69b8 |
13 | 1c01592185 |
14 | db7503d6c |
15 | 7e5e72865 |
hex | 4bff28c1c |
20400213020 has 48 divisors (see below), whose sum is σ = 46781322336. Its totient is φ = 7410912000.
The previous prime is 20400212971. The next prime is 20400213157. The reversal of 20400213020 is 2031200402.
It is a super-2 number, since 2×204002130202 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 20400212986 and 20400213004.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 179210 + ... + 270030.
It is an arithmetic number, because the mean of its divisors is an integer number (974610882).
Almost surely, 220400213020 is an apocalyptic number.
20400213020 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20400213020 is an abundant number, since it is smaller than the sum of its proper divisors (26381109316).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20400213020 is a wasteful number, since it uses less digits than its factorization.
20400213020 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 91862 (or 91860 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 14.
Adding to 20400213020 its reverse (2031200402), we get a palindrome (22431413422).
The spelling of 20400213020 in words is "twenty billion, four hundred million, two hundred thirteen thousand, twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •