Base | Representation |
---|---|
bin | 1001001110000010010001… |
… | …01110101100011101001100 |
3 | 2122210010100200200102010110 |
4 | 10213001020232230131030 |
5 | 10124130024223244023 |
6 | 111041300204040020 |
7 | 4161465245211501 |
oct | 447011056543514 |
9 | 78703320612113 |
10 | 20273465837388 |
11 | 6506a23a34225 |
12 | 2335172833010 |
13 | b40a19ab52ba |
14 | 50135337d4a8 |
15 | 25255cd2aa93 |
hex | 127048bac74c |
20273465837388 has 96 divisors (see below), whose sum is σ = 51707620435968. Its totient is φ = 6154594790400.
The previous prime is 20273465837327. The next prime is 20273465837393. The reversal of 20273465837388 is 88373856437202.
It is a super-2 number, since 2×202734658373882 (a number of 27 digits) contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 75570706 + ... + 75838502.
It is an arithmetic number, because the mean of its divisors is an integer number (538621046208).
Almost surely, 220273465837388 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 20273465837388, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (25853810217984).
20273465837388 is an abundant number, since it is smaller than the sum of its proper divisors (31434154598580).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20273465837388 is a wasteful number, since it uses less digits than its factorization.
20273465837388 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 279823 (or 279821 counting only the distinct ones).
The product of its (nonzero) digits is 325140480, while the sum is 66.
The spelling of 20273465837388 in words is "twenty trillion, two hundred seventy-three billion, four hundred sixty-five million, eight hundred thirty-seven thousand, three hundred eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •