Base | Representation |
---|---|
bin | 101111100110011011… |
… | …1000000110010011101 |
3 | 100202211222021001122221 |
4 | 1133030313000302131 |
5 | 3133322113033041 |
6 | 114543151305341 |
7 | 10246065020353 |
oct | 1371467006235 |
9 | 322758231587 |
10 | 102221221021 |
11 | 3a39623a357 |
12 | 1798981b251 |
13 | 9840a611ca |
14 | 4d3a0637d3 |
15 | 29d42492d1 |
hex | 17ccdc0c9d |
102221221021 has 2 divisors, whose sum is σ = 102221221022. Its totient is φ = 102221221020.
The previous prime is 102221221009. The next prime is 102221221031. The reversal of 102221221021 is 120122122201.
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., 101882256100 + 338964921 = 319190^2 + 18411^2 .
It is an emirp because it is prime and its reverse (120122122201) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 102221221021 - 25 = 102221220989 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 102221220986 and 102221221004.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102221221031) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51110610510 + 51110610511.
It is an arithmetic number, because the mean of its divisors is an integer number (51110610511).
Almost surely, 2102221221021 is an apocalyptic number.
It is an amenable number.
102221221021 is a deficient number, since it is larger than the sum of its proper divisors (1).
102221221021 is an equidigital number, since it uses as much as digits as its factorization.
102221221021 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 64, while the sum is 16.
Adding to 102221221021 its reverse (120122122201), we get a palindrome (222343343222).
The spelling of 102221221021 in words is "one hundred two billion, two hundred twenty-one million, two hundred twenty-one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •