Base | Representation |
---|---|
bin | 101111100011001001… |
… | …0100011110111110100 |
3 | 100202120021212100201200 |
4 | 1133012102203313310 |
5 | 3133110404031400 |
6 | 114524213052500 |
7 | 10243256124402 |
oct | 1370622436764 |
9 | 322507770650 |
10 | 102111002100 |
11 | 3a339aa9238 |
12 | 17958927130 |
13 | 9823c80303 |
14 | 4d29572472 |
15 | 29c9726b00 |
hex | 17c64a3df4 |
102111002100 has 108 divisors (see below), whose sum is σ = 320175093420. Its totient is φ = 27219916800.
The previous prime is 102111002087. The next prime is 102111002113. The reversal of 102111002100 is 1200111201.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (102111002087) and next prime (102111002113).
It can be written as a sum of positive squares in 6 ways, for example, as 2995591824 + 99115410276 = 54732^2 + 314826^2 .
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 35 ways as a sum of consecutive naturals, for example, 2718246 + ... + 2755554.
Almost surely, 2102111002100 is an apocalyptic number.
102111002100 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102111002100 is an abundant number, since it is smaller than the sum of its proper divisors (218064091320).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102111002100 is a wasteful number, since it uses less digits than its factorization.
102111002100 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 40370 (or 40360 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 102111002100 its reverse (1200111201), we get a palindrome (103311113301).
The spelling of 102111002100 in words is "one hundred two billion, one hundred eleven million, two thousand, one hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •