Base | Representation |
---|---|
bin | 1001010001110010001000… |
… | …1000100111001100000011 |
3 | 1100010012212121000101121002 |
4 | 2110130202020213030003 |
5 | 2314113343210323021 |
6 | 33410155124522215 |
7 | 2102002156260446 |
oct | 224344210471403 |
9 | 40105777011532 |
10 | 10201120011011 |
11 | 32832a8338056 |
12 | 118906655036b |
13 | 58cc665137b7 |
14 | 273a45c7b65d |
15 | 12a54b8a250b |
hex | 94722227303 |
10201120011011 has 2 divisors, whose sum is σ = 10201120011012. Its totient is φ = 10201120011010.
The previous prime is 10201120010899. The next prime is 10201120011067. The reversal of 10201120011011 is 11011002110201.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 10201120011011 - 226 = 10201052902147 is a prime.
It is a super-2 number, since 2×102011200110112 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10201120010983 and 10201120011001.
It is not a weakly prime, because it can be changed into another prime (10201120013011) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5100560005505 + 5100560005506.
It is an arithmetic number, because the mean of its divisors is an integer number (5100560005506).
Almost surely, 210201120011011 is an apocalyptic number.
10201120011011 is a deficient number, since it is larger than the sum of its proper divisors (1).
10201120011011 is an equidigital number, since it uses as much as digits as its factorization.
10201120011011 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 10201120011011 its reverse (11011002110201), we get a palindrome (21212122121212).
The spelling of 10201120011011 in words is "ten trillion, two hundred one billion, one hundred twenty million, eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •