Base | Representation |
---|---|
bin | 1110111100110001… |
… | …1011100110100101 |
3 | 101100200012012111102 |
4 | 3233030123212211 |
5 | 31204312412123 |
6 | 1502112445445 |
7 | 201306023363 |
oct | 35714334645 |
9 | 11320165442 |
10 | 4013013413 |
11 | 177a272412 |
12 | 93bb49885 |
13 | 4bc529a66 |
14 | 2a0d80633 |
15 | 187496028 |
hex | ef31b9a5 |
4013013413 has 2 divisors, whose sum is σ = 4013013414. Its totient is φ = 4013013412.
The previous prime is 4013013383. The next prime is 4013013449. The reversal of 4013013413 is 3143103104.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2587044769 + 1425968644 = 50863^2 + 37762^2 .
It is a cyclic number.
It is not a de Polignac number, because 4013013413 - 28 = 4013013157 is a prime.
It is a super-2 number, since 2×40130134132 = 32208553305835817138, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4013010413) 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, 2006506706 + 2006506707.
It is an arithmetic number, because the mean of its divisors is an integer number (2006506707).
Almost surely, 24013013413 is an apocalyptic number.
It is an amenable number.
4013013413 is a deficient number, since it is larger than the sum of its proper divisors (1).
4013013413 is an equidigital number, since it uses as much as digits as its factorization.
4013013413 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 432, while the sum is 20.
The square root of 4013013413 is about 63348.3497259400. The cubic root of 4013013413 is about 1589.1206472877.
Adding to 4013013413 its reverse (3143103104), we get a palindrome (7156116517).
The spelling of 4013013413 in words is "four billion, thirteen million, thirteen thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.648 sec. • engine limits •