Base | Representation |
---|---|
bin | 1001011001010110101000… |
… | …01011001111010110010000 |
3 | 2201011022010212101011202111 |
4 | 10230223110023033112100 |
5 | 10202012444204110000 |
6 | 111540053104555104 |
7 | 4231543232431540 |
oct | 454532413172620 |
9 | 81138125334674 |
10 | 20662352410000 |
11 | 66469442a6094 |
12 | 2398604022a94 |
13 | b6b5b3b638b2 |
14 | 5160c5587320 |
15 | 25c71dc2bcba |
hex | 12cad42cf590 |
20662352410000 has 300 divisors, whose sum is σ = 57394196827968. Its totient is φ = 7056825408000.
The previous prime is 20662352409983. The next prime is 20662352410057. The reversal of 20662352410000 is 1425326602.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 59 ways as a sum of consecutive naturals, for example, 5371028077 + ... + 5371031923.
Almost surely, 220662352410000 is an apocalyptic number.
20662352410000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 20662352410000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (28697098413984).
20662352410000 is an abundant number, since it is smaller than the sum of its proper divisors (36731844417968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20662352410000 is an frugal number, since it uses more digits than its factorization.
20662352410000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4436 (or 4138 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 31.
Adding to 20662352410000 its reverse (1425326602), we get a palindrome (20663777736602).
The spelling of 20662352410000 in words is "twenty trillion, six hundred sixty-two billion, three hundred fifty-two million, four hundred ten thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •