Base | Representation |
---|---|
bin | 1110111100111101… |
… | …1110100100101101 |
3 | 101100201200202222012 |
4 | 3233033132210231 |
5 | 31210013441023 |
6 | 1502141531005 |
7 | 201315560561 |
oct | 35717364455 |
9 | 11321622865 |
10 | 4013812013 |
11 | 177a768412 |
12 | 940273a65 |
13 | 4bc7493c3 |
14 | 2a110b6a1 |
15 | 1875a2978 |
hex | ef3de92d |
4013812013 has 32 divisors (see below), whose sum is σ = 4399349760. Its totient is φ = 3648153600.
The previous prime is 4013811943. The next prime is 4013812021. The reversal of 4013812013 is 3102183104.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4013812013 is a prime.
It is a super-2 number, since 2×40138120132 = 32221373751406224338, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 4013812013.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (4013812063) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17226545 + ... + 17226777.
It is an arithmetic number, because the mean of its divisors is an integer number (137479680).
Almost surely, 24013812013 is an apocalyptic number.
It is an amenable number.
4013812013 is a deficient number, since it is larger than the sum of its proper divisors (385537747).
4013812013 is a wasteful number, since it uses less digits than its factorization.
4013812013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 557.
The product of its (nonzero) digits is 576, while the sum is 23.
The square root of 4013812013 is about 63354.6526547183. The cubic root of 4013812013 is about 1589.2260533292.
Adding to 4013812013 its reverse (3102183104), we get a palindrome (7115995117).
The spelling of 4013812013 in words is "four billion, thirteen million, eight hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •