Base | Representation |
---|---|
bin | 110100001010011101… |
… | …1111011101100111101 |
3 | 101201010220011012001212 |
4 | 1220110323323230331 |
5 | 3313404210430203 |
6 | 123243402014205 |
7 | 11043653506124 |
oct | 1502473735475 |
9 | 351126135055 |
10 | 112020405053 |
11 | 43564664357 |
12 | 198634a7365 |
13 | a742c69b5b |
14 | 55c9670abb |
15 | 2da968b1d8 |
hex | 1a14efbb3d |
112020405053 has 2 divisors, whose sum is σ = 112020405054. Its totient is φ = 112020405052.
The previous prime is 112020405017. The next prime is 112020405061. The reversal of 112020405053 is 350504020211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 111945114724 + 75290329 = 334582^2 + 8677^2 .
It is a cyclic number.
It is not a de Polignac number, because 112020405053 - 26 = 112020404989 is a prime.
It is a super-2 number, since 2×1120204050532 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (112020405073) 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, 56010202526 + 56010202527.
It is an arithmetic number, because the mean of its divisors is an integer number (56010202527).
Almost surely, 2112020405053 is an apocalyptic number.
It is an amenable number.
112020405053 is a deficient number, since it is larger than the sum of its proper divisors (1).
112020405053 is an equidigital number, since it uses as much as digits as its factorization.
112020405053 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1200, while the sum is 23.
Adding to 112020405053 its reverse (350504020211), we get a palindrome (462524425264).
The spelling of 112020405053 in words is "one hundred twelve billion, twenty million, four hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •