Base | Representation |
---|---|
bin | 101111100101110110… |
… | …1101111000101110101 |
3 | 100202210122010010212111 |
4 | 1133023231233011311 |
5 | 3133302203341041 |
6 | 114541223451021 |
7 | 10245442524424 |
oct | 1371355570565 |
9 | 322718103774 |
10 | 102202012021 |
11 | 3a38640a34a |
12 | 179832b6a71 |
13 | 9839a96b35 |
14 | 4d376a32bb |
15 | 29d2702981 |
hex | 17cbb6f175 |
102202012021 has 2 divisors, whose sum is σ = 102202012022. Its totient is φ = 102202012020.
The previous prime is 102202012013. The next prime is 102202012027. The reversal of 102202012021 is 120210202201.
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., 77220628996 + 24981383025 = 277886^2 + 158055^2 .
It is a cyclic number.
It is not a de Polignac number, because 102202012021 - 23 = 102202012013 is a prime.
It is a super-2 number, since 2×1022020120212 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 102202011992 and 102202012010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (102202012027) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 51101006010 + 51101006011.
It is an arithmetic number, because the mean of its divisors is an integer number (51101006011).
Almost surely, 2102202012021 is an apocalyptic number.
It is an amenable number.
102202012021 is a deficient number, since it is larger than the sum of its proper divisors (1).
102202012021 is an equidigital number, since it uses as much as digits as its factorization.
102202012021 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 13.
Adding to 102202012021 its reverse (120210202201), we get a palindrome (222412214222).
The spelling of 102202012021 in words is "one hundred two billion, two hundred two million, twelve thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •