Base | Representation |
---|---|
bin | 1110111001111100… |
… | …0001110001001001 |
3 | 101022211210111121111 |
4 | 3232133001301021 |
5 | 31143241023423 |
6 | 1501005410321 |
7 | 201102611656 |
oct | 35637016111 |
9 | 11284714544 |
10 | 4001111113 |
11 | 1773582aaa |
12 | 937b699a1 |
13 | 4b9c2038c |
14 | 29d562c2d |
15 | 1863e460d |
hex | ee7c1c49 |
4001111113 has 2 divisors, whose sum is σ = 4001111114. Its totient is φ = 4001111112.
The previous prime is 4001111087. The next prime is 4001111141. The reversal of 4001111113 is 3111111004.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 3054441289 + 946669824 = 55267^2 + 30768^2 .
It is a cyclic number.
It is not a de Polignac number, because 4001111113 - 29 = 4001110601 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4001111093 and 4001111102.
It is not a weakly prime, because it can be changed into another prime (4001114113) 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, 2000555556 + 2000555557.
It is an arithmetic number, because the mean of its divisors is an integer number (2000555557).
Almost surely, 24001111113 is an apocalyptic number.
It is an amenable number.
4001111113 is a deficient number, since it is larger than the sum of its proper divisors (1).
4001111113 is an equidigital number, since it uses as much as digits as its factorization.
4001111113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12, while the sum is 13.
The square root of 4001111113 is about 63254.3367129875. The cubic root of 4001111113 is about 1587.5480201896.
Adding to 4001111113 its reverse (3111111004), we get a palindrome (7112222117).
The spelling of 4001111113 in words is "four billion, one million, one hundred eleven thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •