Base | Representation |
---|---|
bin | 110000111001111001… |
… | …1111100100000011001 |
3 | 101001002011211011010001 |
4 | 1201303303330200121 |
5 | 3210041141241441 |
6 | 120125130253001 |
7 | 10405356034231 |
oct | 1416363744031 |
9 | 331064734101 |
10 | 105022212121 |
11 | 405a3334432 |
12 | 1842b887161 |
13 | 9b991475a8 |
14 | 5124064cc1 |
15 | 2aea0cc731 |
hex | 1873cfc819 |
105022212121 has 2 divisors, whose sum is σ = 105022212122. Its totient is φ = 105022212120.
The previous prime is 105022212079. The next prime is 105022212133. The reversal of 105022212121 is 121212220501.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 70336874521 + 34685337600 = 265211^2 + 186240^2 .
It is a cyclic number.
It is not a de Polignac number, because 105022212121 - 219 = 105021687833 is a prime.
It is a super-2 number, since 2×1050222121212 (a number of 23 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (105022212181) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 52511106060 + 52511106061.
It is an arithmetic number, because the mean of its divisors is an integer number (52511106061).
Almost surely, 2105022212121 is an apocalyptic number.
It is an amenable number.
105022212121 is a deficient number, since it is larger than the sum of its proper divisors (1).
105022212121 is an equidigital number, since it uses as much as digits as its factorization.
105022212121 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 160, while the sum is 19.
Adding to 105022212121 its reverse (121212220501), we get a palindrome (226234432622).
The spelling of 105022212121 in words is "one hundred five billion, twenty-two million, two hundred twelve thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.154 sec. • engine limits •