Base | Representation |
---|---|
bin | 11100000011110111100100… |
… | …001010110010101001011111 |
3 | 121011221222200101011102011102 |
4 | 130003313210022302221133 |
5 | 112133431440034200421 |
6 | 1114250142024343315 |
7 | 34665105453231362 |
oct | 3403674412625137 |
9 | 534858611142142 |
10 | 123411123350111 |
11 | 363603aa89a913 |
12 | 11a11a9b614b3b |
13 | 53b2807c2027c |
14 | 22691b75480d9 |
15 | e4031709a60b |
hex | 703de42b2a5f |
123411123350111 has 2 divisors, whose sum is σ = 123411123350112. Its totient is φ = 123411123350110.
The previous prime is 123411123350101. The next prime is 123411123350113. The reversal of 123411123350111 is 111053321114321.
It is a strong prime.
It is an emirp because it is prime and its reverse (111053321114321) is a distict prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-123411123350111 is a prime.
Together with 123411123350113, it forms a pair of twin primes.
It is a Chen prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (123411123350113) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 61705561675055 + 61705561675056.
It is an arithmetic number, because the mean of its divisors is an integer number (61705561675056).
Almost surely, 2123411123350111 is an apocalyptic number.
123411123350111 is a deficient number, since it is larger than the sum of its proper divisors (1).
123411123350111 is an equidigital number, since it uses as much as digits as its factorization.
123411123350111 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2160, while the sum is 29.
Adding to 123411123350111 its reverse (111053321114321), we get a palindrome (234464444464432).
The spelling of 123411123350111 in words is "one hundred twenty-three trillion, four hundred eleven billion, one hundred twenty-three million, three hundred fifty thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •