Base | Representation |
---|---|
bin | 1001010010111000110110… |
… | …0011111101101001010101 |
3 | 1100012000212111101010022212 |
4 | 2110232031203331221111 |
5 | 2314421232131242211 |
6 | 33423014455203205 |
7 | 2103243442313021 |
oct | 224561543755125 |
9 | 40160774333285 |
10 | 10220102212181 |
11 | 3290359296814 |
12 | 1190883676505 |
13 | 5919a008b9b4 |
14 | 274926d01381 |
15 | 12acad0c338b |
hex | 94b8d8fda55 |
10220102212181 has 2 divisors, whose sum is σ = 10220102212182. Its totient is φ = 10220102212180.
The previous prime is 10220102212127. The next prime is 10220102212211. The reversal of 10220102212181 is 18121220102201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8542999511281 + 1677102700900 = 2922841^2 + 1295030^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220102212181 - 210 = 10220102211157 is a prime.
It is a super-2 number, since 2×102201022121812 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10220102215181) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110051106090 + 5110051106091.
It is an arithmetic number, because the mean of its divisors is an integer number (5110051106091).
Almost surely, 210220102212181 is an apocalyptic number.
It is an amenable number.
10220102212181 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220102212181 is an equidigital number, since it uses as much as digits as its factorization.
10220102212181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 256, while the sum is 23.
Adding to 10220102212181 its reverse (18121220102201), we get a palindrome (28341322314382).
The spelling of 10220102212181 in words is "ten trillion, two hundred twenty billion, one hundred two million, two hundred twelve thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •