Base | Representation |
---|---|
bin | 1001001101000100000001… |
… | …0101000000111101110101 |
3 | 1022211110112202011202020202 |
4 | 2103101000111000331311 |
5 | 2311301301140401211 |
6 | 33305023553210245 |
7 | 2063101404251255 |
oct | 223210025007565 |
9 | 38743482152222 |
10 | 10120022200181 |
11 | 32519717814a3 |
12 | 11753b2b60985 |
13 | 585410b1659a |
14 | 26db513b3965 |
15 | 1283a1d3153b |
hex | 93440540f75 |
10120022200181 has 2 divisors, whose sum is σ = 10120022200182. Its totient is φ = 10120022200180.
The previous prime is 10120022200139. The next prime is 10120022200187. The reversal of 10120022200181 is 18100222002101.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8118886601956 + 2001135598225 = 2849366^2 + 1414615^2 .
It is a cyclic number.
It is not a de Polignac number, because 10120022200181 - 26 = 10120022200117 is a prime.
It is a super-2 number, since 2×101200222001812 (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 (10120022200187) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5060011100090 + 5060011100091.
It is an arithmetic number, because the mean of its divisors is an integer number (5060011100091).
Almost surely, 210120022200181 is an apocalyptic number.
It is an amenable number.
10120022200181 is a deficient number, since it is larger than the sum of its proper divisors (1).
10120022200181 is an equidigital number, since it uses as much as digits as its factorization.
10120022200181 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 128, while the sum is 20.
Adding to 10120022200181 its reverse (18100222002101), we get a palindrome (28220244202282).
The spelling of 10120022200181 in words is "ten trillion, one hundred twenty billion, twenty-two million, two hundred thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •