Base | Representation |
---|---|
bin | 101111100011011110… |
… | …0111100010011011101 |
3 | 100202121001202210221122 |
4 | 1133012330330103131 |
5 | 3133121230042341 |
6 | 114525251140325 |
7 | 10243452426413 |
oct | 1370674742335 |
9 | 322531683848 |
10 | 102122112221 |
11 | 3a3452a7458 |
12 | 179605a46a5 |
13 | 982637024c |
14 | 4d2ac252b3 |
15 | 29ca6bd94b |
hex | 17c6f3c4dd |
102122112221 has 2 divisors, whose sum is σ = 102122112222. Its totient is φ = 102122112220.
The previous prime is 102122112217. The next prime is 102122112227. The reversal of 102122112221 is 122211221201.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 86354287321 + 15767824900 = 293861^2 + 125570^2 .
It is a cyclic number.
It is not a de Polignac number, because 102122112221 - 22 = 102122112217 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102122112221.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102122112227) 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 as a sum of consecutive naturals, namely, 51061056110 + 51061056111.
It is an arithmetic number, because the mean of its divisors is an integer number (51061056111).
Almost surely, 2102122112221 is an apocalyptic number.
It is an amenable number.
102122112221 is a deficient number, since it is larger than the sum of its proper divisors (1).
102122112221 is an equidigital number, since it uses as much as digits as its factorization.
102122112221 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 64, while the sum is 17.
Adding to 102122112221 its reverse (122211221201), we get a palindrome (224333333422).
The spelling of 102122112221 in words is "one hundred two billion, one hundred twenty-two million, one hundred twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •