Base | Representation |
---|---|
bin | 1110111100110010… |
… | …0001010111100101 |
3 | 101100200020101220002 |
4 | 3233030201113211 |
5 | 31204314141104 |
6 | 1502113151045 |
7 | 201306152261 |
oct | 35714412745 |
9 | 11320211802 |
10 | 4013037029 |
11 | 177a289131 |
12 | 93bb5b485 |
13 | 4bc537731 |
14 | 2a0d890a1 |
15 | 18749d01e |
hex | ef3215e5 |
4013037029 has 2 divisors, whose sum is σ = 4013037030. Its totient is φ = 4013037028.
The previous prime is 4013037019. The next prime is 4013037031. The reversal of 4013037029 is 9207303104.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3968748004 + 44289025 = 62998^2 + 6655^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4013037029 is a prime.
It is a super-2 number, since 2×40130370292 = 32208932392250293682, which contains 22 as substring.
Together with 4013037031, it forms a pair of twin primes.
It is a Chen prime.
It is a junction number, because it is equal to n+sod(n) for n = 4013036992 and 4013037010.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4013037019) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2006518514 + 2006518515.
It is an arithmetic number, because the mean of its divisors is an integer number (2006518515).
Almost surely, 24013037029 is an apocalyptic number.
It is an amenable number.
4013037029 is a deficient number, since it is larger than the sum of its proper divisors (1).
4013037029 is an equidigital number, since it uses as much as digits as its factorization.
4013037029 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4536, while the sum is 29.
The square root of 4013037029 is about 63348.5361235759. The cubic root of 4013037029 is about 1589.1237645295.
The spelling of 4013037029 in words is "four billion, thirteen million, thirty-seven thousand, twenty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •