Base | Representation |
---|---|
bin | 10000010010011011010… |
… | …011011001001010101011 |
3 | 10222000002201212102211212 |
4 | 100102123103121022223 |
5 | 121314310021034014 |
6 | 2214110432143335 |
7 | 143603136640244 |
oct | 20223323311253 |
9 | 3860081772755 |
10 | 1119297049259 |
11 | 3a1767005794 |
12 | 160b16397b4b |
13 | 8171a94c70c |
14 | 3c262287ccb |
15 | 1e1aeb6523e |
hex | 1049b4d92ab |
1119297049259 has 2 divisors, whose sum is σ = 1119297049260. Its totient is φ = 1119297049258.
The previous prime is 1119297049207. The next prime is 1119297049289. The reversal of 1119297049259 is 9529407929111.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1119297049259 - 224 = 1119280272043 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1119297049198 and 1119297049207.
It is not a weakly prime, because it can be changed into another prime (1119297049289) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 559648524629 + 559648524630.
It is an arithmetic number, because the mean of its divisors is an integer number (559648524630).
Almost surely, 21119297049259 is an apocalyptic number.
1119297049259 is a deficient number, since it is larger than the sum of its proper divisors (1).
1119297049259 is an equidigital number, since it uses as much as digits as its factorization.
1119297049259 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3674160, while the sum is 59.
The spelling of 1119297049259 in words is "one trillion, one hundred nineteen billion, two hundred ninety-seven million, forty-nine thousand, two hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •