Base | Representation |
---|---|
bin | 10100100000101000… |
… | …11001100000000011 |
3 | 1001102101111222011021 |
4 | 22100110121200003 |
5 | 140022331413102 |
6 | 5020344130311 |
7 | 536603443621 |
oct | 122024314003 |
9 | 31371458137 |
10 | 11011201027 |
11 | 4740599342 |
12 | 2173766997 |
13 | 1066349a88 |
14 | 766588511 |
15 | 446a53137 |
hex | 290519803 |
11011201027 has 2 divisors, whose sum is σ = 11011201028. Its totient is φ = 11011201026.
The previous prime is 11011201021. The next prime is 11011201051. The reversal of 11011201027 is 72010211011.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11011201027 is a prime.
It is a super-4 number, since 4×110112010274 (a number of 41 digits) contains 4444 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 11011201027.
It is not a weakly prime, because it can be changed into another prime (11011201021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5505600513 + 5505600514.
It is an arithmetic number, because the mean of its divisors is an integer number (5505600514).
Almost surely, 211011201027 is an apocalyptic number.
11011201027 is a deficient number, since it is larger than the sum of its proper divisors (1).
11011201027 is an equidigital number, since it uses as much as digits as its factorization.
11011201027 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 28, while the sum is 16.
Adding to 11011201027 its reverse (72010211011), we get a palindrome (83021412038).
The spelling of 11011201027 in words is "eleven billion, eleven million, two hundred one thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •