Base | Representation |
---|---|
bin | 100000000010110… |
… | …0100010100110011 |
3 | 2202221011212221112 |
4 | 1000011210110303 |
5 | 4200222420311 |
6 | 254405143535 |
7 | 35434026521 |
oct | 10005442463 |
9 | 2687155845 |
10 | 1075201331 |
11 | 501a17746 |
12 | 2600babab |
13 | 1419aa309 |
14 | a2b25311 |
15 | 645d828b |
hex | 40164533 |
1075201331 has 2 divisors, whose sum is σ = 1075201332. Its totient is φ = 1075201330.
The previous prime is 1075201321. The next prime is 1075201357. The reversal of 1075201331 is 1331025701.
It is a weak prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1075201331 is a prime.
It is a super-2 number, since 2×10752013312 = 2312115804368343122, which contains 22 as substring.
It is a Sophie Germain prime.
It is a junction number, because it is equal to n+sod(n) for n = 1075201297 and 1075201306.
It is not a weakly prime, because it can be changed into another prime (1075201321) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 537600665 + 537600666.
It is an arithmetic number, because the mean of its divisors is an integer number (537600666).
Almost surely, 21075201331 is an apocalyptic number.
1075201331 is a deficient number, since it is larger than the sum of its proper divisors (1).
1075201331 is an equidigital number, since it uses as much as digits as its factorization.
1075201331 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 630, while the sum is 23.
The square root of 1075201331 is about 32790.2627467363. The cubic root of 1075201331 is about 1024.4637547207.
The spelling of 1075201331 in words is "one billion, seventy-five million, two hundred one thousand, three hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •