Base | Representation |
---|---|
bin | 101111100110001000… |
… | …0011100110001001011 |
3 | 100202211021020110201011 |
4 | 1133030100130301023 |
5 | 3133312021041021 |
6 | 114542150504351 |
7 | 10245613055131 |
oct | 1371420346113 |
9 | 322737213634 |
10 | 102211112011 |
11 | 3a3905652a8 |
12 | 179863650b7 |
13 | 983b931b48 |
14 | 4d38991751 |
15 | 29d33edde1 |
hex | 17cc41cc4b |
102211112011 has 8 divisors (see below), whose sum is σ = 103957162560. Its totient is φ = 100465516872.
The previous prime is 102211111997. The next prime is 102211112063. The reversal of 102211112011 is 110211112201.
It is a happy number.
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 102211112011 - 231 = 100063628363 is a prime.
It is a super-2 number, since 2×1022111120112 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102211111982 and 102211112000.
It is not an unprimeable number, because it can be changed into a prime (102211112911) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 355216 + ... + 574978.
It is an arithmetic number, because the mean of its divisors is an integer number (12994645320).
Almost surely, 2102211112011 is an apocalyptic number.
102211112011 is a deficient number, since it is larger than the sum of its proper divisors (1746050549).
102211112011 is an equidigital number, since it uses as much as digits as its factorization.
102211112011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 227705.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102211112011 its reverse (110211112201), we get a palindrome (212422224212).
The spelling of 102211112011 in words is "one hundred two billion, two hundred eleven million, one hundred twelve thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •