Base | Representation |
---|---|
bin | 10000010011000110100… |
… | …000111100000011010101 |
3 | 10222001222021000210011111 |
4 | 100103012200330003111 |
5 | 121322301114122214 |
6 | 2214310410535021 |
7 | 143630122043413 |
oct | 20230640740325 |
9 | 3861867023144 |
10 | 1120022020309 |
11 | 3a1aa9260215 |
12 | 161099137471 |
13 | 81804bc2a7a |
14 | 3c2d06822b3 |
15 | 1e20361b5c4 |
hex | 104c683c0d5 |
1120022020309 has 2 divisors, whose sum is σ = 1120022020310. Its totient is φ = 1120022020308.
The previous prime is 1120022020283. The next prime is 1120022020331. The reversal of 1120022020309 is 9030202200211.
It is an a-pointer prime, because the next prime (1120022020331) can be obtained adding 1120022020309 to its sum of digits (22).
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 691854641284 + 428167379025 = 831778^2 + 654345^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120022020309 - 213 = 1120022012117 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1120022020309.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1120022020349) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560011010154 + 560011010155.
It is an arithmetic number, because the mean of its divisors is an integer number (560011010155).
Almost surely, 21120022020309 is an apocalyptic number.
It is an amenable number.
1120022020309 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120022020309 is an equidigital number, since it uses as much as digits as its factorization.
1120022020309 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 432, while the sum is 22.
The spelling of 1120022020309 in words is "one trillion, one hundred twenty billion, twenty-two million, twenty thousand, three hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •