Base | Representation |
---|---|
bin | 101111100110011001… |
… | …0101111011001011101 |
3 | 100202211220011011120120 |
4 | 1133030302233121131 |
5 | 3133321321214323 |
6 | 114543111305153 |
7 | 10246052344536 |
oct | 1371462573135 |
9 | 322756134516 |
10 | 102220101213 |
11 | 3a395644a9a |
12 | 1798937b1b9 |
13 | 984075b5b9 |
14 | 4d39c5168d |
15 | 29d40c75e3 |
hex | 17cccaf65d |
102220101213 has 16 divisors (see below), whose sum is σ = 143566072320. Its totient is φ = 64515395376.
The previous prime is 102220101211. The next prime is 102220101253. The reversal of 102220101213 is 312101022201.
It is not a de Polignac number, because 102220101213 - 21 = 102220101211 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102220101192 and 102220101201.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102220101211) 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 15 ways as a sum of consecutive naturals, for example, 537195 + ... + 702152.
It is an arithmetic number, because the mean of its divisors is an integer number (8972879520).
Almost surely, 2102220101213 is an apocalyptic number.
It is an amenable number.
102220101213 is a deficient number, since it is larger than the sum of its proper divisors (41345971107).
102220101213 is a wasteful number, since it uses less digits than its factorization.
102220101213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1240816.
The product of its (nonzero) digits is 48, while the sum is 15.
Adding to 102220101213 its reverse (312101022201), we get a palindrome (414321123414).
The spelling of 102220101213 in words is "one hundred two billion, two hundred twenty million, one hundred one thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •