Base | Representation |
---|---|
bin | 1110111010001001… |
… | …1010110110111001 |
3 | 101022220110200100211 |
4 | 3232202122312321 |
5 | 31144003002223 |
6 | 1501040431121 |
7 | 201113304253 |
oct | 35642326671 |
9 | 11286420324 |
10 | 4002000313 |
11 | 1774030083 |
12 | 9383184a1 |
13 | 4ba17202c |
14 | 29d714cd3 |
15 | 18651cd0d |
hex | ee89adb9 |
4002000313 has 2 divisors, whose sum is σ = 4002000314. Its totient is φ = 4002000312.
The previous prime is 4002000307. The next prime is 4002000337. The reversal of 4002000313 is 3130002004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2632408249 + 1369592064 = 51307^2 + 37008^2 .
It is a cyclic number.
It is not a de Polignac number, because 4002000313 - 25 = 4002000281 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4002000293 and 4002000302.
It is not a weakly prime, because it can be changed into another prime (4002000113) 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, 2001000156 + 2001000157.
It is an arithmetic number, because the mean of its divisors is an integer number (2001000157).
Almost surely, 24002000313 is an apocalyptic number.
It is an amenable number.
4002000313 is a deficient number, since it is larger than the sum of its proper divisors (1).
4002000313 is an equidigital number, since it uses as much as digits as its factorization.
4002000313 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 72, while the sum is 13.
The square root of 4002000313 is about 63261.3650896027. The cubic root of 4002000313 is about 1587.6656161189.
Adding to 4002000313 its reverse (3130002004), we get a palindrome (7132002317).
The spelling of 4002000313 in words is "four billion, two million, three hundred thirteen", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •