Base | Representation |
---|---|
bin | 10111001101110000001000… |
… | …110010110100101001101101 |
3 | 111101111200020012222102211001 |
4 | 113031300020302310221231 |
5 | 101340302011141213401 |
6 | 1001052050522400301 |
7 | 30335326623361300 |
oct | 2715601062645155 |
9 | 441450205872731 |
10 | 102100110101101 |
11 | 2a594460453702 |
12 | b54b828360091 |
13 | 44c7ccac59118 |
14 | 1b2d9591c2b37 |
15 | bc0cd14d4601 |
hex | 5cdc08cb4a6d |
102100110101101 has 24 divisors (see below), whose sum is σ = 125426581527744. Its totient is φ = 82700859890880.
The previous prime is 102100110101089. The next prime is 102100110101159. The reversal of 102100110101101 is 101101011001201.
It is not a de Polignac number, because 102100110101101 - 213 = 102100110092909 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100110101161) by changing a digit.
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 23 ways as a sum of consecutive naturals, for example, 545657040 + ... + 545844121.
It is an arithmetic number, because the mean of its divisors is an integer number (5226107563656).
Almost surely, 2102100110101101 is an apocalyptic number.
It is an amenable number.
102100110101101 is a deficient number, since it is larger than the sum of its proper divisors (23326471426643).
102100110101101 is a wasteful number, since it uses less digits than its factorization.
102100110101101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1091501281 (or 1091501274 counting only the distinct ones).
The product of its (nonzero) digits is 2, while the sum is 10.
Adding to 102100110101101 its reverse (101101011001201), we get a palindrome (203201121102302).
The spelling of 102100110101101 in words is "one hundred two trillion, one hundred billion, one hundred ten million, one hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •