Base | Representation |
---|---|
bin | 111100100111001… |
… | …110100001000101 |
3 | 2121212111200112221 |
4 | 330213032201011 |
5 | 4040312303122 |
6 | 244524012341 |
7 | 34125433534 |
oct | 7447164105 |
9 | 2555450487 |
10 | 1016916037 |
11 | 482028085 |
12 | 2446910b1 |
13 | 1328b0987 |
14 | 990b231b |
15 | 5e4236c7 |
hex | 3c9ce845 |
1016916037 has 2 divisors, whose sum is σ = 1016916038. Its totient is φ = 1016916036.
The previous prime is 1016916007. The next prime is 1016916053. The reversal of 1016916037 is 7306196101.
1016916037 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1001659201 + 15256836 = 31649^2 + 3906^2 .
It is a cyclic number.
It is not a de Polignac number, because 1016916037 - 215 = 1016883269 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1016915993 and 1016916011.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1016916007) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 508458018 + 508458019.
It is an arithmetic number, because the mean of its divisors is an integer number (508458019).
Almost surely, 21016916037 is an apocalyptic number.
It is an amenable number.
1016916037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1016916037 is an equidigital number, since it uses as much as digits as its factorization.
1016916037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6804, while the sum is 34.
The square root of 1016916037 is about 31889.1209819274. The cubic root of 1016916037 is about 1005.6071797709.
The spelling of 1016916037 in words is "one billion, sixteen million, nine hundred sixteen thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •