Base | Representation |
---|---|
bin | 101111100011001001… |
… | …0100011011000100101 |
3 | 100202120021212020222122 |
4 | 1133012102203120211 |
5 | 3133110404000401 |
6 | 114524213035325 |
7 | 10243256115515 |
oct | 1370622433045 |
9 | 322507766878 |
10 | 102111000101 |
11 | 3a339aa7790 |
12 | 17958925b45 |
13 | 9823c7c426 |
14 | 4d29571845 |
15 | 29c972621b |
hex | 17c64a3625 |
102111000101 has 24 divisors (see below), whose sum is σ = 116390930400. Its totient is φ = 88736984000.
The previous prime is 102111000091. The next prime is 102111000133. The reversal of 102111000101 is 101000111201.
It is a happy number.
It is a de Polignac number, because none of the positive numbers 2k-102111000101 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111020101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 3238430 + ... + 3269808.
It is an arithmetic number, because the mean of its divisors is an integer number (4849622100).
Almost surely, 2102111000101 is an apocalyptic number.
102111000101 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
102111000101 is a deficient number, since it is larger than the sum of its proper divisors (14279930299).
102111000101 is a wasteful number, since it uses less digits than its factorization.
102111000101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 31621 (or 31520 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 8.
Adding to 102111000101 its reverse (101000111201), we get a palindrome (203111111302).
Subtracting from 102111000101 its reverse (101000111201), we obtain a square (1110888900 = 333302).
The spelling of 102111000101 in words is "one hundred two billion, one hundred eleven million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •