Base | Representation |
---|---|
bin | 111111011110011… |
… | …010101000110101 |
3 | 2202012212110100112 |
4 | 333132122220311 |
5 | 4140111004122 |
6 | 253401152405 |
7 | 35250552422 |
oct | 7736325065 |
9 | 2665773315 |
10 | 1064938037 |
11 | 4a7147789 |
12 | 25878b705 |
13 | 13c825967 |
14 | a1612d49 |
15 | 6375c2e2 |
hex | 3f79aa35 |
1064938037 has 2 divisors, whose sum is σ = 1064938038. Its totient is φ = 1064938036.
The previous prime is 1064938001. The next prime is 1064938051. The reversal of 1064938037 is 7308394601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1039998001 + 24940036 = 32249^2 + 4994^2 .
It is a cyclic number.
It is not a de Polignac number, because 1064938037 - 214 = 1064921653 is a prime.
It is a super-2 number, since 2×10649380372 = 2268186045298826738, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1064937985 and 1064938003.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1064938337) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 532469018 + 532469019.
It is an arithmetic number, because the mean of its divisors is an integer number (532469019).
Almost surely, 21064938037 is an apocalyptic number.
It is an amenable number.
1064938037 is a deficient number, since it is larger than the sum of its proper divisors (1).
1064938037 is an equidigital number, since it uses as much as digits as its factorization.
1064938037 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108864, while the sum is 41.
The square root of 1064938037 is about 32633.3883775498. The cubic root of 1064938037 is about 1021.1936675899.
The spelling of 1064938037 in words is "one billion, sixty-four million, nine hundred thirty-eight thousand, thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •