Base | Representation |
---|---|
bin | 100001011101111… |
… | …1011000000001111 |
3 | 2220021010112110201 |
4 | 1002323323000033 |
5 | 4244442120211 |
6 | 303233514331 |
7 | 36554244253 |
oct | 10273730017 |
9 | 2807115421 |
10 | 1123004431 |
11 | 5269a793a |
12 | 2741129a7 |
13 | 14b876783 |
14 | a920a263 |
15 | 688cc0c1 |
hex | 42efb00f |
1123004431 has 2 divisors, whose sum is σ = 1123004432. Its totient is φ = 1123004430.
The previous prime is 1123004413. The next prime is 1123004447. The reversal of 1123004431 is 1344003211.
Together with previous prime (1123004413) it forms an Ormiston pair, because they use the same digits, order apart.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1123004431 - 27 = 1123004303 is a prime.
It is a super-2 number, since 2×11230044312 = 2522277904091267522, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1123004399 and 1123004408.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1123004401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561502215 + 561502216.
It is an arithmetic number, because the mean of its divisors is an integer number (561502216).
Almost surely, 21123004431 is an apocalyptic number.
1123004431 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123004431 is an equidigital number, since it uses as much as digits as its factorization.
1123004431 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 288, while the sum is 19.
The square root of 1123004431 is about 33511.2582724075. The cubic root of 1123004431 is about 1039.4265918831.
Adding to 1123004431 its reverse (1344003211), we get a palindrome (2467007642).
The spelling of 1123004431 in words is "one billion, one hundred twenty-three million, four thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •