Base | Representation |
---|---|
bin | 1110111010111001… |
… | …0000010110100101 |
3 | 101100010022022110122 |
4 | 3232232100112211 |
5 | 31200301244023 |
6 | 1501231131325 |
7 | 201151546112 |
oct | 35656202645 |
9 | 11303268418 |
10 | 4005103013 |
11 | 177585a19a |
12 | 939373b45 |
13 | 4ba9ba352 |
14 | 29dcc1909 |
15 | 1869322c8 |
hex | eeb905a5 |
4005103013 has 2 divisors, whose sum is σ = 4005103014. Its totient is φ = 4005103012.
The previous prime is 4005103009. The next prime is 4005103079. The reversal of 4005103013 is 3103015004.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3033035329 + 972067684 = 55073^2 + 31178^2 .
It is a cyclic number.
It is not a de Polignac number, because 4005103013 - 22 = 4005103009 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4005102982 and 4005103000.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4005103093) 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, 2002551506 + 2002551507.
It is an arithmetic number, because the mean of its divisors is an integer number (2002551507).
Almost surely, 24005103013 is an apocalyptic number.
It is an amenable number.
4005103013 is a deficient number, since it is larger than the sum of its proper divisors (1).
4005103013 is an equidigital number, since it uses as much as digits as its factorization.
4005103013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 180, while the sum is 17.
The square root of 4005103013 is about 63285.8832047085. The cubic root of 4005103013 is about 1588.0758091253.
Adding to 4005103013 its reverse (3103015004), we get a palindrome (7108118017).
The spelling of 4005103013 in words is "four billion, five million, one hundred three thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •