Base | Representation |
---|---|
bin | 1001000110001110011010… |
… | …00001000101111110111000 |
3 | 2121211110122222100212211010 |
4 | 10203013031001011332320 |
5 | 10110230422143012100 |
6 | 110314114522233520 |
7 | 4133215040665101 |
oct | 443071501057670 |
9 | 77743588325733 |
10 | 20005102313400 |
11 | 64131307a6676 |
12 | 22b11583558a0 |
13 | b2161c3b60a9 |
14 | 4d2375b533a8 |
15 | 24a5a2c9c750 |
hex | 1231cd045fb8 |
20005102313400 has 192 divisors, whose sum is σ = 62090169055200. Its totient is φ = 5328301824000.
The previous prime is 20005102313359. The next prime is 20005102313509. The reversal of 20005102313400 is 431320150002.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 3584498610 + ... + 3584504190.
Almost surely, 220005102313400 is an apocalyptic number.
20005102313400 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 20005102313400, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (31045084527600).
20005102313400 is an abundant number, since it is smaller than the sum of its proper divisors (42085066741800).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
20005102313400 is a wasteful number, since it uses less digits than its factorization.
20005102313400 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11690 (or 11681 counting only the distinct ones).
The product of its (nonzero) digits is 720, while the sum is 21.
Adding to 20005102313400 its reverse (431320150002), we get a palindrome (20436422463402).
The spelling of 20005102313400 in words is "twenty trillion, five billion, one hundred two million, three hundred thirteen thousand, four hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •