Base | Representation |
---|---|
bin | 101111100101110110… |
… | …1101111000111001111 |
3 | 100202210122010010222211 |
4 | 1133023231233013033 |
5 | 3133302203341421 |
6 | 114541223451251 |
7 | 10245442524613 |
oct | 1371355570717 |
9 | 322718103884 |
10 | 102202012111 |
11 | 3a38640a421 |
12 | 179832b6b27 |
13 | 9839a96ba4 |
14 | 4d376a3343 |
15 | 29d27029e1 |
hex | 17cbb6f1cf |
102202012111 has 8 divisors (see below), whose sum is σ = 107593713920. Its totient is φ = 96811575192.
The previous prime is 102202012093. The next prime is 102202012153. The reversal of 102202012111 is 111210202201.
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 102202012111 - 235 = 67842273743 is a prime.
It is a super-3 number, since 3×1022020121113 (a number of 34 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102202012091 and 102202012100.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102202012511) 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, 148065 + ... + 475738.
It is an arithmetic number, because the mean of its divisors is an integer number (13449214240).
Almost surely, 2102202012111 is an apocalyptic number.
102202012111 is a deficient number, since it is larger than the sum of its proper divisors (5391701809).
102202012111 is an equidigital number, since it uses as much as digits as its factorization.
102202012111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 632445.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 102202012111 its reverse (111210202201), we get a palindrome (213412214312).
The spelling of 102202012111 in words is "one hundred two billion, two hundred two million, twelve thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •