Base | Representation |
---|---|
bin | 10000010100111101001… |
… | …101110101111010001001 |
3 | 10222021010001100120222212 |
4 | 100110331031311322021 |
5 | 121340340424044423 |
6 | 2215240151154505 |
7 | 144030353262626 |
oct | 20247515657211 |
9 | 3867101316885 |
10 | 1122013503113 |
11 | 3a293040a778 |
12 | 161554075a35 |
13 | 81a61677469 |
14 | 3c43cd6134d |
15 | 1e2bd39a578 |
hex | 1053d375e89 |
1122013503113 has 4 divisors (see below), whose sum is σ = 1160703623940. Its totient is φ = 1083323382288.
The previous prime is 1122013503103. The next prime is 1122013503139. The reversal of 1122013503113 is 3113053102211.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 902266315129 + 219747187984 = 949877^2 + 468772^2 .
It is a cyclic number.
It is not a de Polignac number, because 1122013503113 - 24 = 1122013503097 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1122013503103) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 19345060370 + ... + 19345060427.
It is an arithmetic number, because the mean of its divisors is an integer number (290175905985).
Almost surely, 21122013503113 is an apocalyptic number.
It is an amenable number.
1122013503113 is a deficient number, since it is larger than the sum of its proper divisors (38690120827).
1122013503113 is an equidigital number, since it uses as much as digits as its factorization.
1122013503113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 38690120826.
The product of its (nonzero) digits is 540, while the sum is 23.
Adding to 1122013503113 its reverse (3113053102211), we get a palindrome (4235066605324).
The spelling of 1122013503113 in words is "one trillion, one hundred twenty-two billion, thirteen million, five hundred three thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •