Base | Representation |
---|---|
bin | 10000010011011110011… |
… | …110111010110010110101 |
3 | 10222010000021200210020111 |
4 | 100103132132322302311 |
5 | 121324112040102203 |
6 | 2214414333503021 |
7 | 143643104042014 |
oct | 20233636726265 |
9 | 3863007623214 |
10 | 1120424144053 |
11 | 3a2195246795 |
12 | 16118b941a71 |
13 | 8186a2c8c06 |
14 | 3c32bc3aa7b |
15 | 1e228a9e26d |
hex | 104de7bacb5 |
1120424144053 has 2 divisors, whose sum is σ = 1120424144054. Its totient is φ = 1120424144052.
The previous prime is 1120424143999. The next prime is 1120424144101. The reversal of 1120424144053 is 3504414240211.
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., 1110035030724 + 10389113329 = 1053582^2 + 101927^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1120424144053 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120424144153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560212072026 + 560212072027.
It is an arithmetic number, because the mean of its divisors is an integer number (560212072027).
Almost surely, 21120424144053 is an apocalyptic number.
It is an amenable number.
1120424144053 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120424144053 is an equidigital number, since it uses as much as digits as its factorization.
1120424144053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 15360, while the sum is 31.
Adding to 1120424144053 its reverse (3504414240211), we get a palindrome (4624838384264).
The spelling of 1120424144053 in words is "one trillion, one hundred twenty billion, four hundred twenty-four million, one hundred forty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •