Base | Representation |
---|---|
bin | 10000010101111110101… |
… | …101111110000111111101 |
3 | 10222100221122012121001111 |
4 | 100111332231332013331 |
5 | 121400113241210123 |
6 | 2215541205242021 |
7 | 144066526156261 |
oct | 20257655760775 |
9 | 3870848177044 |
10 | 1123112444413 |
11 | 3a3344771623 |
12 | 161800103311 |
13 | 81ba824729b |
14 | 3c504ca60a1 |
15 | 1e334ac290d |
hex | 1057eb7e1fd |
1123112444413 has 2 divisors, whose sum is σ = 1123112444414. Its totient is φ = 1123112444412.
The previous prime is 1123112444411. The next prime is 1123112444423. The reversal of 1123112444413 is 3144442113211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 714814448089 + 408297996324 = 845467^2 + 638982^2 .
It is a cyclic number.
It is not a de Polignac number, because 1123112444413 - 21 = 1123112444411 is a prime.
It is a super-2 number, since 2×11231124444132 (a number of 25 digits) contains 22 as substring.
Together with 1123112444411, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1123112444411) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 561556222206 + 561556222207.
It is an arithmetic number, because the mean of its divisors is an integer number (561556222207).
Almost surely, 21123112444413 is an apocalyptic number.
It is an amenable number.
1123112444413 is a deficient number, since it is larger than the sum of its proper divisors (1).
1123112444413 is an equidigital number, since it uses as much as digits as its factorization.
1123112444413 is an evil number, because the sum of its binary digits is even.
The product of its digits is 9216, while the sum is 31.
Adding to 1123112444413 its reverse (3144442113211), we get a palindrome (4267554557624).
The spelling of 1123112444413 in words is "one trillion, one hundred twenty-three billion, one hundred twelve million, four hundred forty-four thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •