Base | Representation |
---|---|
bin | 101111100110001000… |
… | …0000110110100010101 |
3 | 100202211021001220101011 |
4 | 1133030100012310111 |
5 | 3133312010201401 |
6 | 114542144532221 |
7 | 10245612232036 |
oct | 1371420066425 |
9 | 322737056334 |
10 | 102211022101 |
11 | 3a3905037a1 |
12 | 17986321071 |
13 | 983b8ccc46 |
14 | 4d3896aa8d |
15 | 29d33d2451 |
hex | 17cc406d15 |
102211022101 has 8 divisors (see below), whose sum is σ = 107625441600. Its totient is φ = 96800091840.
The previous prime is 102211022083. The next prime is 102211022117. The reversal of 102211022101 is 101220112201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102211022101 - 231 = 100063538453 is a prime.
It is a super-2 number, since 2×1022110221012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102211022141) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 812065 + ... + 929446.
It is an arithmetic number, because the mean of its divisors is an integer number (13453180200).
Almost surely, 2102211022101 is an apocalyptic number.
It is an amenable number.
102211022101 is a deficient number, since it is larger than the sum of its proper divisors (5414419499).
102211022101 is a wasteful number, since it uses less digits than its factorization.
102211022101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1744619.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102211022101 its reverse (101220112201), we get a palindrome (203431134302).
The spelling of 102211022101 in words is "one hundred two billion, two hundred eleven million, twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •