Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …001010011111100010011000 |
3 | 111010102122202111201011201210 |
4 | 112300223100022133202120 |
5 | 101110032344023241440 |
6 | 552522120221143120 |
7 | 30041062611505044 |
oct | 2660532012374230 |
9 | 433378674634653 |
10 | 100102000212120 |
11 | 29994024514245 |
12 | b2885313baaa0 |
13 | 43b176917544a |
14 | 1aa0d69785024 |
15 | b88d3940ea80 |
hex | 5b0ad029f898 |
100102000212120 has 64 divisors (see below), whose sum is σ = 305229049849440. Its totient is φ = 26256262348800.
The previous prime is 100102000212103. The next prime is 100102000212161. The reversal of 100102000212120 is 21212000201001.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a junction number, because it is equal to n+sod(n) for n = 100102000212096 and 100102000212105.
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, 6837561001 + ... + 6837575640.
Almost surely, 2100102000212120 is an apocalyptic number.
100102000212120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100102000212120 is an abundant number, since it is smaller than the sum of its proper divisors (205127049637320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102000212120 is a wasteful number, since it uses less digits than its factorization.
100102000212120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13675136716 (or 13675136712 counting only the distinct ones).
The product of its (nonzero) digits is 16, while the sum is 12.
Adding to 100102000212120 its reverse (21212000201001), we get a palindrome (121314000413121).
The spelling of 100102000212120 in words is "one hundred trillion, one hundred two billion, two hundred twelve thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •