Base | Representation |
---|---|
bin | 11111111111000111001… |
… | …11101100101000101111 |
3 | 10220001210200011211112211 |
4 | 33333203213230220233 |
5 | 121001311041314314 |
6 | 2200520120511251 |
7 | 142255060366333 |
oct | 17774347545057 |
9 | 3801720154484 |
10 | 1099035494959 |
11 | 394109981096 |
12 | 15900091b527 |
13 | 7c83c01822c |
14 | 3b29d3597c3 |
15 | 1d8c5e819c4 |
hex | ffe39eca2f |
1099035494959 has 2 divisors, whose sum is σ = 1099035494960. Its totient is φ = 1099035494958.
The previous prime is 1099035494897. The next prime is 1099035494989. The reversal of 1099035494959 is 9594945309901.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 1099035494959 - 211 = 1099035492911 is a prime.
It is a super-2 number, since 2×10990354949592 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1099035494894 and 1099035494903.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1099035494989) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 549517747479 + 549517747480.
It is an arithmetic number, because the mean of its divisors is an integer number (549517747480).
Almost surely, 21099035494959 is an apocalyptic number.
1099035494959 is a deficient number, since it is larger than the sum of its proper divisors (1).
1099035494959 is an equidigital number, since it uses as much as digits as its factorization.
1099035494959 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 70858800, while the sum is 67.
The spelling of 1099035494959 in words is "one trillion, ninety-nine billion, thirty-five million, four hundred ninety-four thousand, nine hundred fifty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •