Base | Representation |
---|---|
bin | 101111100110000110… |
… | …0100110001111001101 |
3 | 100202211012100011112112 |
4 | 1133030030212033031 |
5 | 3133311241232341 |
6 | 114542113113405 |
7 | 10245601351133 |
oct | 1371414461715 |
9 | 322735304475 |
10 | 102210102221 |
11 | 3a38aa35667 |
12 | 17985b58865 |
13 | 983b66a336 |
14 | 4d387ab753 |
15 | 29d329eaeb |
hex | 17cc3263cd |
102210102221 has 2 divisors, whose sum is σ = 102210102222. Its totient is φ = 102210102220.
The previous prime is 102210102151. The next prime is 102210102257. The reversal of 102210102221 is 122201012201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 87548524996 + 14661577225 = 295886^2 + 121085^2 .
It is a cyclic number.
It is not a de Polignac number, because 102210102221 - 214 = 102210085837 is a prime.
It is a super-3 number, since 3×1022101022213 (a number of 34 digits) contains 333 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102210102196 and 102210102205.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102210107221) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51105051110 + 51105051111.
It is an arithmetic number, because the mean of its divisors is an integer number (51105051111).
Almost surely, 2102210102221 is an apocalyptic number.
It is an amenable number.
102210102221 is a deficient number, since it is larger than the sum of its proper divisors (1).
102210102221 is an equidigital number, since it uses as much as digits as its factorization.
102210102221 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 32, while the sum is 14.
Adding to 102210102221 its reverse (122201012201), we get a palindrome (224411114422).
The spelling of 102210102221 in words is "one hundred two billion, two hundred ten million, one hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •