Base | Representation |
---|---|
bin | 101111110001011000111011… |
… | …100110110010110101001111 |
3 | 1000112220120112021102000100202 |
4 | 233301120323212302311033 |
5 | 210014303311303224101 |
6 | 2022503342314044115 |
7 | 62153245426305656 |
oct | 5761307346626517 |
9 | 1015816467360322 |
10 | 210102210211151 |
11 | 60a43935346855 |
12 | 1b69327111963b |
13 | 9030726ac218b |
14 | 39c500354c19d |
15 | 19453922a436b |
hex | bf163b9b2d4f |
210102210211151 has 2 divisors, whose sum is σ = 210102210211152. Its totient is φ = 210102210211150.
The previous prime is 210102210211099. The next prime is 210102210211177. The reversal of 210102210211151 is 151112012201012.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 210102210211151 - 218 = 210102209949007 is a prime.
It is a super-2 number, since 2×2101022102111512 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (210102210211351) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 105051105105575 + 105051105105576.
It is an arithmetic number, because the mean of its divisors is an integer number (105051105105576).
Almost surely, 2210102210211151 is an apocalyptic number.
210102210211151 is a deficient number, since it is larger than the sum of its proper divisors (1).
210102210211151 is an equidigital number, since it uses as much as digits as its factorization.
210102210211151 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 80, while the sum is 20.
Adding to 210102210211151 its reverse (151112012201012), we get a palindrome (361214222412163).
The spelling of 210102210211151 in words is "two hundred ten trillion, one hundred two billion, two hundred ten million, two hundred eleven thousand, one hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.107 sec. • engine limits •