Base | Representation |
---|---|
bin | 10111000010001001000010… |
… | …010000101111111011010000 |
3 | 111021200101201012210101200210 |
4 | 113002021002100233323100 |
5 | 101234213411321032240 |
6 | 555241332025244120 |
7 | 30223562131256436 |
oct | 2702110220577320 |
9 | 437611635711623 |
10 | 101302210330320 |
11 | 2a30703187423a |
12 | b441069333640 |
13 | 446a9b014aa3c |
14 | 1b030a5b66d56 |
15 | baa1827a2780 |
hex | 5c224242fed0 |
101302210330320 has 80 divisors (see below), whose sum is σ = 314058181079232. Its totient is φ = 27012087997440.
The previous prime is 101302210330271. The next prime is 101302210330397. The reversal of 101302210330320 is 23033012203101.
It is a tau number, because it is divible by the number of its divisors (80).
It is a super-2 number, since 2×1013022103303202 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 10791237 + ... + 17862116.
Almost surely, 2101302210330320 is an apocalyptic number.
101302210330320 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101302210330320 is an abundant number, since it is smaller than the sum of its proper divisors (212755970748912).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101302210330320 is a wasteful number, since it uses less digits than its factorization.
101302210330320 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 28668100 (or 28668094 counting only the distinct ones).
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 101302210330320 its reverse (23033012203101), we get a palindrome (124335222533421).
The spelling of 101302210330320 in words is "one hundred one trillion, three hundred two billion, two hundred ten million, three hundred thirty thousand, three hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.033 sec. • engine limits •