Base | Representation |
---|---|
bin | 110011101111010101… |
… | …1000101111110111011 |
3 | 101121210110002212222212 |
4 | 1213132223011332323 |
5 | 3310023131133201 |
6 | 123013201205335 |
7 | 11012260411301 |
oct | 1473653057673 |
9 | 347713085885 |
10 | 111110021051 |
11 | 4313778a387 |
12 | 1964a63084b |
13 | a629478bb3 |
14 | 55407b0271 |
15 | 2d547acabb |
hex | 19deac5fbb |
111110021051 has 2 divisors, whose sum is σ = 111110021052. Its totient is φ = 111110021050.
The previous prime is 111110020999. The next prime is 111110021083. The reversal of 111110021051 is 150120011111.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-111110021051 is a prime.
It is not a weakly prime, because it can be changed into another prime (111110021651) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55555010525 + 55555010526.
It is an arithmetic number, because the mean of its divisors is an integer number (55555010526).
Almost surely, 2111110021051 is an apocalyptic number.
111110021051 is a deficient number, since it is larger than the sum of its proper divisors (1).
111110021051 is an equidigital number, since it uses as much as digits as its factorization.
111110021051 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 10, while the sum is 14.
Adding to 111110021051 its reverse (150120011111), we get a palindrome (261230032162).
The spelling of 111110021051 in words is "one hundred eleven billion, one hundred ten million, twenty-one thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •