Base | Representation |
---|---|
bin | 11111111111001000100… |
… | …01100011101001100101 |
3 | 10220001211102211100000001 |
4 | 33333210101203221211 |
5 | 121001321343440242 |
6 | 2200521152021301 |
7 | 142255252561306 |
oct | 17774421435145 |
9 | 3801742740001 |
10 | 1099046468197 |
11 | 394115096487 |
12 | 159004531831 |
13 | 7c84138aa82 |
14 | 3b2a09b47ad |
15 | 1d8c6deceb7 |
hex | ffe4463a65 |
1099046468197 has 2 divisors, whose sum is σ = 1099046468198. Its totient is φ = 1099046468196.
The previous prime is 1099046468171. The next prime is 1099046468209. The reversal of 1099046468197 is 7918646409901.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 948726648676 + 150319819521 = 974026^2 + 387711^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1099046468197 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1099046468167) 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, 549523234098 + 549523234099.
It is an arithmetic number, because the mean of its divisors is an integer number (549523234099).
Almost surely, 21099046468197 is an apocalyptic number.
It is an amenable number.
1099046468197 is a deficient number, since it is larger than the sum of its proper divisors (1).
1099046468197 is an equidigital number, since it uses as much as digits as its factorization.
1099046468197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 23514624, while the sum is 64.
The spelling of 1099046468197 in words is "one trillion, ninety-nine billion, forty-six million, four hundred sixty-eight thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •