Base | Representation |
---|---|
bin | 10000010011001100111… |
… | …101010010001010100001 |
3 | 10222002020210102112010021 |
4 | 100103030331102022201 |
5 | 121323011302123314 |
6 | 2214325231433441 |
7 | 143632603606111 |
oct | 20231475221241 |
9 | 3862223375107 |
10 | 1120130114209 |
11 | 3a205427a817 |
12 | 161109385881 |
13 | 8182140b662 |
14 | 3c300b7d041 |
15 | 1e20cd6e324 |
hex | 104ccf522a1 |
1120130114209 has 2 divisors, whose sum is σ = 1120130114210. Its totient is φ = 1120130114208.
The previous prime is 1120130114143. The next prime is 1120130114231. The reversal of 1120130114209 is 9024110310211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 928964413584 + 191165700625 = 963828^2 + 437225^2 .
It is a cyclic number.
It is not a de Polignac number, because 1120130114209 - 231 = 1117982630561 is a prime.
It is not a weakly prime, because it can be changed into another prime (1120130124209) 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, 560065057104 + 560065057105.
It is an arithmetic number, because the mean of its divisors is an integer number (560065057105).
Almost surely, 21120130114209 is an apocalyptic number.
It is an amenable number.
1120130114209 is a deficient number, since it is larger than the sum of its proper divisors (1).
1120130114209 is an equidigital number, since it uses as much as digits as its factorization.
1120130114209 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 25.
The spelling of 1120130114209 in words is "one trillion, one hundred twenty billion, one hundred thirty million, one hundred fourteen thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •