Base | Representation |
---|---|
bin | 101111100011001011… |
… | …1001000100110001101 |
3 | 100202120101010021110010 |
4 | 1133012113020212031 |
5 | 3133111210413401 |
6 | 114524254503433 |
7 | 10243302250131 |
oct | 1370627104615 |
9 | 322511107403 |
10 | 102112201101 |
11 | 3a33a748049 |
12 | 17959204b79 |
13 | 98242acc91 |
14 | 4d297a53c1 |
15 | 29c98b1ed6 |
hex | 17c65c898d |
102112201101 has 32 divisors (see below), whose sum is σ = 143465177088. Its totient is φ = 64519773120.
The previous prime is 102112201099. The next prime is 102112201109. The reversal of 102112201101 is 101102211201.
It is not a de Polignac number, because 102112201101 - 21 = 102112201099 is a prime.
It is a super-2 number, since 2×1021122011012 (a number of 23 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102112201109) by changing a digit.
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 31 ways as a sum of consecutive naturals, for example, 1030600 + ... + 1125326.
It is an arithmetic number, because the mean of its divisors is an integer number (4483286784).
Almost surely, 2102112201101 is an apocalyptic number.
It is an amenable number.
102112201101 is a deficient number, since it is larger than the sum of its proper divisors (41352975987).
102112201101 is a wasteful number, since it uses less digits than its factorization.
102112201101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 95001.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102112201101 its reverse (101102211201), we get a palindrome (203214412302).
The spelling of 102112201101 in words is "one hundred two billion, one hundred twelve million, two hundred one thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •