Base | Representation |
---|---|
bin | 10001111010100011111… |
… | …100001100000111010011 |
3 | 11100200201020202022021101 |
4 | 101322203330030013103 |
5 | 130132303421023443 |
6 | 2341321543405231 |
7 | 154642036532635 |
oct | 21724374140723 |
9 | 4320636668241 |
10 | 1231111111123 |
11 | 435125144383 |
12 | 17a720753817 |
13 | 8c129c20cba |
14 | 4382c364a55 |
15 | 2205614284d |
hex | 11ea3f0c1d3 |
1231111111123 has 2 divisors, whose sum is σ = 1231111111124. Its totient is φ = 1231111111122.
The previous prime is 1231111111079. The next prime is 1231111111159. The reversal of 1231111111123 is 3211111111321.
It is a m-pointer prime, because the next prime (1231111111159) can be obtained adding 1231111111123 to its product of digits (36).
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1231111111123 - 29 = 1231111110611 is a prime.
It is a super-2 number, since 2×12311111111232 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1231111111123.
It is not a weakly prime, because it can be changed into another prime (1231111111423) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 615555555561 + 615555555562.
It is an arithmetic number, because the mean of its divisors is an integer number (615555555562).
Almost surely, 21231111111123 is an apocalyptic number.
1231111111123 is a deficient number, since it is larger than the sum of its proper divisors (1).
1231111111123 is an equidigital number, since it uses as much as digits as its factorization.
1231111111123 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 36, while the sum is 19.
Adding to 1231111111123 its reverse (3211111111321), we get a palindrome (4442222222444).
The spelling of 1231111111123 in words is "one trillion, two hundred thirty-one billion, one hundred eleven million, one hundred eleven thousand, one hundred twenty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •