Base | Representation |
---|---|
bin | 1110111101100000… |
… | …1110001000110101 |
3 | 101100220000012222012 |
4 | 3233120032020311 |
5 | 31211110311424 |
6 | 1502303014005 |
7 | 201344214662 |
oct | 35730161065 |
9 | 11326005865 |
10 | 4016103989 |
11 | 1780a93407 |
12 | 940b9a305 |
13 | 4c006c6c1 |
14 | 2a1546a69 |
15 | 1878a6b0e |
hex | ef60e235 |
4016103989 has 2 divisors, whose sum is σ = 4016103990. Its totient is φ = 4016103988.
The previous prime is 4016103977. The next prime is 4016104039. The reversal of 4016103989 is 9893016104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3403788964 + 612315025 = 58342^2 + 24745^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4016103989 is a prime.
It is a super-2 number, since 2×40161039892 = 32258182500923424242, which contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4016103089) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2008051994 + 2008051995.
It is an arithmetic number, because the mean of its divisors is an integer number (2008051995).
Almost surely, 24016103989 is an apocalyptic number.
It is an amenable number.
4016103989 is a deficient number, since it is larger than the sum of its proper divisors (1).
4016103989 is an equidigital number, since it uses as much as digits as its factorization.
4016103989 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 46656, while the sum is 41.
The square root of 4016103989 is about 63372.7385316431. The cubic root of 4016103989 is about 1589.5284902538.
The spelling of 4016103989 in words is "four billion, sixteen million, one hundred three thousand, nine hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •