Base | Representation |
---|---|
bin | 1001010010111000110101… |
… | …1100010101000110001001 |
3 | 1100012000212100121110100001 |
4 | 2110232031130111012021 |
5 | 2314421231123223311 |
6 | 33423014344243001 |
7 | 2103243416306635 |
oct | 224561534250611 |
9 | 40160770543301 |
10 | 10220100211081 |
11 | 329035814a312 |
12 | 1190882a70461 |
13 | 59199c83ac07 |
14 | 27492693ddc5 |
15 | 12acacd2a4c1 |
hex | 94b8d715189 |
10220100211081 has 2 divisors, whose sum is σ = 10220100211082. Its totient is φ = 10220100211080.
The previous prime is 10220100211043. The next prime is 10220100211091. The reversal of 10220100211081 is 18011200102201.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5528799795600 + 4691300415481 = 2351340^2 + 2165941^2 .
It is a cyclic number.
It is not a de Polignac number, because 10220100211081 - 225 = 10220066656649 is a prime.
It is a super-3 number, since 3×102201002110813 (a number of 40 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (10220100211091) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5110050105540 + 5110050105541.
It is an arithmetic number, because the mean of its divisors is an integer number (5110050105541).
Almost surely, 210220100211081 is an apocalyptic number.
It is an amenable number.
10220100211081 is a deficient number, since it is larger than the sum of its proper divisors (1).
10220100211081 is an equidigital number, since it uses as much as digits as its factorization.
10220100211081 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 19.
Adding to 10220100211081 its reverse (18011200102201), we get a palindrome (28231300313282).
The spelling of 10220100211081 in words is "ten trillion, two hundred twenty billion, one hundred million, two hundred eleven thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •