Base | Representation |
---|---|
bin | 11110100100111010101… |
… | …10101101111010000011 |
3 | 10201102210221211100000001 |
4 | 33102131112231322003 |
5 | 114203123132421324 |
6 | 2122351113140431 |
7 | 135622100432341 |
oct | 17223526557203 |
9 | 3642727740001 |
10 | 1050611998339 |
11 | 3756200a13a2 |
12 | 14b7479ba717 |
13 | 780c2a75457 |
14 | 38bc8164991 |
15 | 1c4debe8e44 |
hex | f49d5ade83 |
1050611998339 has 2 divisors, whose sum is σ = 1050611998340. Its totient is φ = 1050611998338.
The previous prime is 1050611998321. The next prime is 1050611998343. The reversal of 1050611998339 is 9338991160501.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1050611998339 - 25 = 1050611998307 is a prime.
It is a super-2 number, since 2×10506119983392 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1050611998339.
It is not a weakly prime, because it can be changed into another prime (1050611998309) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525305999169 + 525305999170.
It is an arithmetic number, because the mean of its divisors is an integer number (525305999170).
Almost surely, 21050611998339 is an apocalyptic number.
1050611998339 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050611998339 is an equidigital number, since it uses as much as digits as its factorization.
1050611998339 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1574640, while the sum is 55.
The spelling of 1050611998339 in words is "one trillion, fifty billion, six hundred eleven million, nine hundred ninety-eight thousand, three hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.092 sec. • engine limits •