Base | Representation |
---|---|
bin | 10111001111100001101010… |
… | …100110011101000100000011 |
3 | 111101221022212122100111211021 |
4 | 113033201222212131010003 |
5 | 101344301134042011321 |
6 | 1001224050530530311 |
7 | 30350203463351665 |
oct | 2717415246350403 |
9 | 441838778314737 |
10 | 102222010110211 |
11 | 2a63112486a792 |
12 | b56b388436997 |
13 | 450665697b224 |
14 | 1b358009d6535 |
15 | bc406819a941 |
hex | 5cf86a99d103 |
102222010110211 has 4 divisors (see below), whose sum is σ = 102250224855792. Its totient is φ = 102193795364632.
The previous prime is 102222010110203. The next prime is 102222010110229. The reversal of 102222010110211 is 112011010222201.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 102222010110211 - 23 = 102222010110203 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102222010110281) 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 3 ways as a sum of consecutive naturals, for example, 14107367356 + ... + 14107374601.
It is an arithmetic number, because the mean of its divisors is an integer number (25562556213948).
Almost surely, 2102222010110211 is an apocalyptic number.
102222010110211 is a deficient number, since it is larger than the sum of its proper divisors (28214745581).
102222010110211 is an equidigital number, since it uses as much as digits as its factorization.
102222010110211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 28214745580.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102222010110211 its reverse (112011010222201), we get a palindrome (214233020332412).
The spelling of 102222010110211 in words is "one hundred two trillion, two hundred twenty-two billion, ten million, one hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •