Base | Representation |
---|---|
bin | 10110111101110001011101… |
… | …100010101111001100000000 |
3 | 111020121200212110022211210102 |
4 | 112331301131202233030000 |
5 | 101214304114200220000 |
6 | 554451404303421532 |
7 | 30163104135264122 |
oct | 2675613542571400 |
9 | 436550773284712 |
10 | 101002020320000 |
11 | 2a200797398418 |
12 | b3b2a502b48a8 |
13 | 44485acb51ab7 |
14 | 1ad27496c3212 |
15 | ba24635ae3d5 |
hex | 5bdc5d8af300 |
101002020320000 has 180 divisors, whose sum is σ = 252976687465656. Its totient is φ = 40233154560000.
The previous prime is 101002020319961. The next prime is 101002020320017. The reversal of 101002020320000 is 23020200101.
It is a happy number.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 37250327 + ... + 39869673.
Almost surely, 2101002020320000 is an apocalyptic number.
101002020320000 is a gapful number since it is divisible by the number (10) 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 101002020320000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (126488343732828).
101002020320000 is an abundant number, since it is smaller than the sum of its proper divisors (151974667145656).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101002020320000 is an frugal number, since it uses more digits than its factorization.
101002020320000 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2619624 (or 2619595 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 11.
Adding to 101002020320000 its reverse (23020200101), we get a palindrome (101025040520101).
The spelling of 101002020320000 in words is "one hundred one trillion, two billion, twenty million, three hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •