Base | Representation |
---|---|
bin | 1001000110001100111011… |
… | …10100101001001110100100 |
3 | 2121211101121210110122111001 |
4 | 10203012131310221032210 |
5 | 10110222311443130430 |
6 | 110313504155323044 |
7 | 4133156314603510 |
oct | 443063564511644 |
9 | 77741553418431 |
10 | 20004310520740 |
11 | 6412864861077 |
12 | 22b0b77150484 |
13 | b21524347b20 |
14 | 4d22dc923140 |
15 | 24a5584e73ca |
hex | 12319dd293a4 |
20004310520740 has 192 divisors, whose sum is σ = 56301398899200. Its totient is φ = 5791000449024.
The previous prime is 20004310520699. The next prime is 20004310520767. The reversal of 20004310520740 is 4702501340002.
It is a Harshad number since it is a multiple of its sum of digits (28).
It is a junction number, because it is equal to n+sod(n) for n = 20004310520699 and 20004310520708.
It is an unprimeable number.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8971209 + ... + 10976848.
It is an arithmetic number, because the mean of its divisors is an integer number (293236452600).
Almost surely, 220004310520740 is an apocalyptic number.
20004310520740 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20004310520740 is an abundant number, since it is smaller than the sum of its proper divisors (36297088378460).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20004310520740 is a wasteful number, since it uses less digits than its factorization.
20004310520740 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19948134 (or 19948132 counting only the distinct ones).
The product of its (nonzero) digits is 6720, while the sum is 28.
Adding to 20004310520740 its reverse (4702501340002), we get a palindrome (24706811860742).
The spelling of 20004310520740 in words is "twenty trillion, four billion, three hundred ten million, five hundred twenty thousand, seven hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •