Base | Representation |
---|---|
bin | 10000010110010001001… |
… | …111001100010000111001 |
3 | 10222101202021211201100102 |
4 | 100112101033030100321 |
5 | 121401232311033334 |
6 | 2220032104445145 |
7 | 144110321105051 |
oct | 20262117142071 |
9 | 3871667751312 |
10 | 1123423142969 |
11 | 3a3494092a96 |
12 | 1618881797b5 |
13 | 81c2771c89a |
14 | 3c534262561 |
15 | 1e351ee667e |
hex | 105913cc439 |
1123423142969 has 2 divisors, whose sum is σ = 1123423142970. Its totient is φ = 1123423142968.
The previous prime is 1123423142899. The next prime is 1123423142987. The reversal of 1123423142969 is 9692413243211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 988855225744 + 134567917225 = 994412^2 + 366835^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123423142969 - 240 = 23911515193 is a prime.
It is a super-2 number, since 2×11234231429692 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1123423142669) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561711571484 + 561711571485.
It is an arithmetic number, because the mean of its divisors is an integer number (561711571485).
Almost surely, 21123423142969 is an apocalyptic number.
It is an amenable number.
1123423142969 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123423142969 is an equidigital number, since it uses as much as digits as its factorization.
1123423142969 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 559872, while the sum is 47.
The spelling of 1123423142969 in words is "one trillion, one hundred twenty-three billion, four hundred twenty-three million, one hundred forty-two thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •