Base | Representation |
---|---|
bin | 10100101011110100… |
… | …10000010101101011 |
3 | 1001122221001000022121 |
4 | 22111322100111223 |
5 | 140220340323201 |
6 | 5033534532111 |
7 | 542123015341 |
oct | 122572202553 |
9 | 31587030277 |
10 | 11105011051 |
11 | 4789542192 |
12 | 219b067037 |
13 | 107c903c74 |
14 | 774c07991 |
15 | 44edd39a1 |
hex | 295e9056b |
11105011051 has 2 divisors, whose sum is σ = 11105011052. Its totient is φ = 11105011050.
The previous prime is 11105011013. The next prime is 11105011063. The reversal of 11105011051 is 15011050111.
11105011051 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 not a de Polignac number, because 11105011051 - 27 = 11105010923 is a prime.
It is not a weakly prime, because it can be changed into another prime (11105011651) 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, 5552505525 + 5552505526.
It is an arithmetic number, because the mean of its divisors is an integer number (5552505526).
Almost surely, 211105011051 is an apocalyptic number.
11105011051 is a deficient number, since it is larger than the sum of its proper divisors (1).
11105011051 is an equidigital number, since it uses as much as digits as its factorization.
11105011051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 11105011051 its reverse (15011050111), we get a palindrome (26116061162).
The spelling of 11105011051 in words is "eleven billion, one hundred five million, eleven thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •