Base | Representation |
---|---|
bin | 1001010010000110011101… |
… | …01011100010100000110000 |
3 | 2200021110220200001022200110 |
4 | 10221003032223202200300 |
5 | 10133422113420020030 |
6 | 111225401141421320 |
7 | 4204541640020532 |
oct | 451031653424060 |
9 | 80243820038613 |
10 | 20413152110640 |
11 | 6560195218863 |
12 | 235825740a840 |
13 | b50c4b681563 |
14 | 508005063852 |
15 | 255ed622b1b0 |
hex | 1290ceae2830 |
20413152110640 has 80 divisors (see below), whose sum is σ = 63933150703968. Its totient is φ = 5387388592128.
The previous prime is 20413152110629. The next prime is 20413152110641. The reversal of 20413152110640 is 4601125131402.
It is a tau number, because it is divible by the number of its divisors (80).
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a junction number, because it is equal to n+sod(n) for n = 20413152110598 and 20413152110607.
It is not an unprimeable number, because it can be changed into a prime (20413152110641) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 438403527 + ... + 438450086.
Almost surely, 220413152110640 is an apocalyptic number.
20413152110640 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
20413152110640 is an abundant number, since it is smaller than the sum of its proper divisors (43519998593328).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20413152110640 is a wasteful number, since it uses less digits than its factorization.
20413152110640 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 876853726 (or 876853720 counting only the distinct ones).
The product of its (nonzero) digits is 5760, while the sum is 30.
The spelling of 20413152110640 in words is "twenty trillion, four hundred thirteen billion, one hundred fifty-two million, one hundred ten thousand, six hundred forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •