Base | Representation |
---|---|
bin | 11001010000110011111111… |
… | …101101000111110010111111 |
3 | 112120101200022022002120122112 |
4 | 121100303333231013302333 |
5 | 104030332110013001143 |
6 | 1032145342345204235 |
7 | 32255115513560045 |
oct | 3120637755076277 |
9 | 476350268076575 |
10 | 111106504031423 |
11 | 32447004a9226a |
12 | 1056522749067b |
13 | 49cc3b56ac524 |
14 | 1d6182513c395 |
15 | cca2061ade18 |
hex | 650cffb47cbf |
111106504031423 has 2 divisors, whose sum is σ = 111106504031424. Its totient is φ = 111106504031422.
The previous prime is 111106504031399. The next prime is 111106504031459. The reversal of 111106504031423 is 324130405601111.
It is a weak prime.
It is an emirp because it is prime and its reverse (324130405601111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 111106504031423 - 216 = 111106503965887 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 111106504031423.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (111106504031323) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 55553252015711 + 55553252015712.
It is an arithmetic number, because the mean of its divisors is an integer number (55553252015712).
Almost surely, 2111106504031423 is an apocalyptic number.
111106504031423 is a deficient number, since it is larger than the sum of its proper divisors (1).
111106504031423 is an equidigital number, since it uses as much as digits as its factorization.
111106504031423 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8640, while the sum is 32.
Adding to 111106504031423 its reverse (324130405601111), we get a palindrome (435236909632534).
The spelling of 111106504031423 in words is "one hundred eleven trillion, one hundred six billion, five hundred four million, thirty-one thousand, four hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •