Base | Representation |
---|---|
bin | 10100100110000110… |
… | …11111110011001011 |
3 | 1001112120212222111022 |
4 | 22103003133303023 |
5 | 140121104231102 |
6 | 5025104023055 |
7 | 541001550026 |
oct | 122303376313 |
9 | 31476788438 |
10 | 11057102027 |
11 | 476449a454 |
12 | 2187001a8b |
13 | 10729cb52a |
14 | 76c6d61bd |
15 | 44aabd5a2 |
hex | 2930dfccb |
11057102027 has 4 divisors (see below), whose sum is σ = 11158543440. Its totient is φ = 10955660616.
The previous prime is 11057101969. The next prime is 11057102047. The reversal of 11057102027 is 72020175011.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 11057102027 - 26 = 11057101963 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11057101987 and 11057102005.
It is not an unprimeable number, because it can be changed into a prime (11057102047) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 50720543 + ... + 50720760.
It is an arithmetic number, because the mean of its divisors is an integer number (2789635860).
Almost surely, 211057102027 is an apocalyptic number.
11057102027 is a deficient number, since it is larger than the sum of its proper divisors (101441413).
11057102027 is a wasteful number, since it uses less digits than its factorization.
11057102027 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 101441412.
The product of its (nonzero) digits is 980, while the sum is 26.
Adding to 11057102027 its reverse (72020175011), we get a palindrome (83077277038).
The spelling of 11057102027 in words is "eleven billion, fifty-seven million, one hundred two thousand, twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •