Base | Representation |
---|---|
bin | 1001010010010110111110… |
… | …1111101000111110100101 |
3 | 1100011011101222120121220011 |
4 | 2110211233233220332211 |
5 | 2314244123034202211 |
6 | 33414512453010221 |
7 | 2102502253055245 |
oct | 224455757507645 |
9 | 40134358517804 |
10 | 10211012022181 |
11 | 32875140a44a3 |
12 | 118ab67323971 |
13 | 590b81a21149 |
14 | 27430392db25 |
15 | 12a92a02d921 |
hex | 9496fbe8fa5 |
10211012022181 has 2 divisors, whose sum is σ = 10211012022182. Its totient is φ = 10211012022180.
The previous prime is 10211012022139. The next prime is 10211012022191. The reversal of 10211012022181 is 18122021011201.
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., 9542229902500 + 668782119681 = 3089050^2 + 817791^2 .
It is a cyclic number.
It is not a de Polignac number, because 10211012022181 - 211 = 10211012020133 is a prime.
It is a super-2 number, since 2×102110120221812 (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 (10211012022191) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5105506011090 + 5105506011091.
It is an arithmetic number, because the mean of its divisors is an integer number (5105506011091).
Almost surely, 210211012022181 is an apocalyptic number.
It is an amenable number.
10211012022181 is a deficient number, since it is larger than the sum of its proper divisors (1).
10211012022181 is an equidigital number, since it uses as much as digits as its factorization.
10211012022181 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 22.
Adding to 10211012022181 its reverse (18122021011201), we get a palindrome (28333033033382).
The spelling of 10211012022181 in words is "ten trillion, two hundred eleven billion, twelve million, twenty-two thousand, one hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •