Base | Representation |
---|---|
bin | 10110110000101011011100… |
… | …000101000101101011110100 |
3 | 111010102200021102212122200010 |
4 | 112300223130011011223310 |
5 | 101110033301212401400 |
6 | 552522152122020220 |
7 | 30041100556636011 |
oct | 2660533405055364 |
9 | 433380242778603 |
10 | 100102200122100 |
11 | 29994117345600 |
12 | b288588347670 |
13 | 43b179b6ca787 |
14 | 1aa0d88142708 |
15 | b88d4bc4c450 |
hex | 5b0adc145af4 |
100102200122100 has 108 divisors (see below), whose sum is σ = 318352572867392. Its totient is φ = 24267200020800.
The previous prime is 100102200122069. The next prime is 100102200122129. The reversal of 100102200122100 is 1221002201001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 1378781884 + ... + 1378854483.
Almost surely, 2100102200122100 is an apocalyptic number.
100102200122100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100102200122100 is an abundant number, since it is smaller than the sum of its proper divisors (218250372745292).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102200122100 is a wasteful number, since it uses less digits than its factorization.
100102200122100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2757636406 (or 2757636388 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100102200122100 its reverse (1221002201001), we get a palindrome (101323202323101).
The spelling of 100102200122100 in words is "one hundred trillion, one hundred two billion, two hundred million, one hundred twenty-two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •