Base | Representation |
---|---|
bin | 10000010011001100011… |
… | …110110000100010101001 |
3 | 10222002020020100222101102 |
4 | 100103030132300202221 |
5 | 121323002230042134 |
6 | 2214324344131145 |
7 | 143632445600414 |
oct | 20231436604251 |
9 | 3862206328342 |
10 | 1120122112169 |
11 | 3a204a804765 |
12 | 161106766ab5 |
13 | 8181c869318 |
14 | 3c2dda98b7b |
15 | 1e20c2dd37e |
hex | 104cc7b08a9 |
1120122112169 has 2 divisors, whose sum is σ = 1120122112170. Its totient is φ = 1120122112168.
The previous prime is 1120122112159. The next prime is 1120122112229. The reversal of 1120122112169 is 9612112210211.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1003677374569 + 116444737600 = 1001837^2 + 341240^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120122112169 - 240 = 20610484393 is a prime.
It is a super-3 number, since 3×11201221121693 (a number of 37 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is not a weakly prime, because it can be changed into another prime (1120122112159) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 560061056084 + 560061056085.
It is an arithmetic number, because the mean of its divisors is an integer number (560061056085).
Almost surely, 21120122112169 is an apocalyptic number.
It is an amenable number.
1120122112169 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120122112169 is an equidigital number, since it uses as much as digits as its factorization.
1120122112169 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 864, while the sum is 29.
The spelling of 1120122112169 in words is "one trillion, one hundred twenty billion, one hundred twenty-two million, one hundred twelve thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •