Base | Representation |
---|---|
bin | 10110110000101011010000… |
… | …110100000010001110010100 |
3 | 111010102122210021012102222101 |
4 | 112300223100310002032110 |
5 | 101110032404320231400 |
6 | 552522121250411444 |
7 | 30041063103202210 |
oct | 2660532064021624 |
9 | 433378707172871 |
10 | 100102011102100 |
11 | 2999402a682027 |
12 | b288534b90b84 |
13 | 43b176b4b9117 |
14 | 1aa0d6adbb940 |
15 | b88d3a36156a |
hex | 5b0ad0d02394 |
100102011102100 has 36 divisors (see below), whose sum is σ = 248252987534944. Its totient is φ = 34320689520480.
The previous prime is 100102011102077. The next prime is 100102011102193. The reversal of 100102011102100 is 1201110201001.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 71501435802 + ... + 71501437201.
Almost surely, 2100102011102100 is an apocalyptic number.
100102011102100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
100102011102100 is an abundant number, since it is smaller than the sum of its proper divisors (148150976432844).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
100102011102100 is a wasteful number, since it uses less digits than its factorization.
100102011102100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 143002873024 (or 143002873017 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 100102011102100 its reverse (1201110201001), we get a palindrome (101303121303101).
The spelling of 100102011102100 in words is "one hundred trillion, one hundred two billion, eleven million, one hundred two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •