Base | Representation |
---|---|
bin | 10000010101111110110… |
… | …000100110000000010001 |
3 | 10222100221200111112022111 |
4 | 100111332300212000101 |
5 | 121400113430211144 |
6 | 2215541232105321 |
7 | 144066535052116 |
oct | 20257660460021 |
9 | 3870850445274 |
10 | 1123113132049 |
11 | 3a33450a1217 |
12 | 161800395241 |
13 | 81ba842827c |
14 | 3c50500490d |
15 | 1e334bab534 |
hex | 1057ec26011 |
1123113132049 has 2 divisors, whose sum is σ = 1123113132050. Its totient is φ = 1123113132048.
The previous prime is 1123113132047. The next prime is 1123113132217. The reversal of 1123113132049 is 9402313113211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1060941200400 + 62171931649 = 1030020^2 + 249343^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123113132049 - 21 = 1123113132047 is a prime.
It is a super-2 number, since 2×11231131320492 (a number of 25 digits) contains 22 as substring.
Together with 1123113132047, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 1123113132049.
It is not a weakly prime, because it can be changed into another prime (1123113132041) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561556566024 + 561556566025.
It is an arithmetic number, because the mean of its divisors is an integer number (561556566025).
Almost surely, 21123113132049 is an apocalyptic number.
It is an amenable number.
1123113132049 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123113132049 is an equidigital number, since it uses as much as digits as its factorization.
1123113132049 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 3888, while the sum is 31.
The spelling of 1123113132049 in words is "one trillion, one hundred twenty-three billion, one hundred thirteen million, one hundred thirty-two thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •