Base | Representation |
---|---|
bin | 1010000001011101001001… |
… | …0110011001011110100111 |
3 | 1110000111212010100210111202 |
4 | 2200113102112121132213 |
5 | 2421023201232414002 |
6 | 35234323501153115 |
7 | 2215114565106662 |
oct | 240272226313647 |
9 | 43014763323452 |
10 | 11020120201127 |
11 | 3569674617904 |
12 | 129b933b5b79b |
13 | 61c2679962cb |
14 | 2a153b7ca6d9 |
15 | 1419d2c6a502 |
hex | a05d25997a7 |
11020120201127 has 2 divisors, whose sum is σ = 11020120201128. Its totient is φ = 11020120201126.
The previous prime is 11020120201067. The next prime is 11020120201133. The reversal of 11020120201127 is 72110202102011.
It is a happy number.
11020120201127 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11020120201127 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11020120201099 and 11020120201108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11020120201147) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5510060100563 + 5510060100564.
It is an arithmetic number, because the mean of its divisors is an integer number (5510060100564).
Almost surely, 211020120201127 is an apocalyptic number.
11020120201127 is a deficient number, since it is larger than the sum of its proper divisors (1).
11020120201127 is an equidigital number, since it uses as much as digits as its factorization.
11020120201127 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 112, while the sum is 20.
Adding to 11020120201127 its reverse (72110202102011), we get a palindrome (83130322303138).
The spelling of 11020120201127 in words is "eleven trillion, twenty billion, one hundred twenty million, two hundred one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •