Base | Representation |
---|---|
bin | 111110000000100… |
… | …000101010101101 |
3 | 2200111112210101201 |
4 | 332000200222231 |
5 | 4112310234242 |
6 | 251121405501 |
7 | 34531404256 |
oct | 7600405255 |
9 | 2614483351 |
10 | 1040321197 |
11 | 494263793 |
12 | 250499891 |
13 | 1376b6c96 |
14 | 9c245b2d |
15 | 614e84b7 |
hex | 3e020aad |
1040321197 has 2 divisors, whose sum is σ = 1040321198. Its totient is φ = 1040321196.
The previous prime is 1040321189. The next prime is 1040321201. The reversal of 1040321197 is 7911230401.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 986650921 + 53670276 = 31411^2 + 7326^2 .
It is an emirp because it is prime and its reverse (7911230401) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1040321197 - 23 = 1040321189 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1040321297) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 520160598 + 520160599.
It is an arithmetic number, because the mean of its divisors is an integer number (520160599).
Almost surely, 21040321197 is an apocalyptic number.
It is an amenable number.
1040321197 is a deficient number, since it is larger than the sum of its proper divisors (1).
1040321197 is an equidigital number, since it uses as much as digits as its factorization.
1040321197 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1512, while the sum is 28.
The square root of 1040321197 is about 32254.0105568284. The cubic root of 1040321197 is about 1013.2636955718.
Adding to 1040321197 its reverse (7911230401), we get a palindrome (8951551598).
The spelling of 1040321197 in words is "one billion, forty million, three hundred twenty-one thousand, one hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •