Base | Representation |
---|---|
bin | 10111000110110010111000… |
… | …000000101111101000011000 |
3 | 111022210222011211201221000110 |
4 | 113012302320000233220120 |
5 | 101304433340414114300 |
6 | 1000044301455404320 |
7 | 30255643140604401 |
oct | 2706627000575030 |
9 | 438728154657013 |
10 | 101622013426200 |
11 | 2a41a721331583 |
12 | b49303a8236a0 |
13 | 4491bb7912157 |
14 | 1b14762d769a8 |
15 | bb364d785550 |
hex | 5c6cb802fa18 |
101622013426200 has 96 divisors (see below), whose sum is σ = 315033398246160. Its totient is φ = 27098760000000.
The previous prime is 101622013426187. The next prime is 101622013426267. The reversal of 101622013426200 is 2624310226101.
It is a super-2 number, since 2×1016220134262002 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 36145662 + ... + 38855538.
Almost surely, 2101622013426200 is an apocalyptic number.
101622013426200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
101622013426200 is an abundant number, since it is smaller than the sum of its proper divisors (213411384819960).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
101622013426200 is a wasteful number, since it uses less digits than its factorization.
101622013426200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2772397 (or 2772388 counting only the distinct ones).
The product of its (nonzero) digits is 6912, while the sum is 30.
The spelling of 101622013426200 in words is "one hundred one trillion, six hundred twenty-two billion, thirteen million, four hundred twenty-six thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •