Base | Representation |
---|---|
bin | 1110111101000010… |
… | …1111111101111101 |
3 | 101100202022201022001 |
4 | 3233100233331331 |
5 | 31210110123110 |
6 | 1502153022301 |
7 | 201321446554 |
oct | 35720577575 |
9 | 11322281261 |
10 | 4014145405 |
11 | 177a975946 |
12 | 9403b4991 |
13 | 4bc83508a |
14 | 2a1196d9b |
15 | 18761b63a |
hex | ef42ff7d |
4014145405 has 16 divisors (see below), whose sum is σ = 4842669744. Its totient is φ = 3194219520.
The previous prime is 4014145307. The next prime is 4014145439. The reversal of 4014145405 is 5045414104.
It can be written as a sum of positive squares in 8 ways, for example, as 89624089 + 3924521316 = 9467^2 + 62646^2 .
It is a de Polignac number, because none of the positive numbers 2k-4014145405 is a prime.
It is a super-2 number, since 2×40141454052 = 32226726664965228050, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1489239 + ... + 1491931.
It is an arithmetic number, because the mean of its divisors is an integer number (302666859).
Almost surely, 24014145405 is an apocalyptic number.
It is an amenable number.
4014145405 is a deficient number, since it is larger than the sum of its proper divisors (828524339).
4014145405 is a wasteful number, since it uses less digits than its factorization.
4014145405 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4176.
The product of its (nonzero) digits is 6400, while the sum is 28.
The square root of 4014145405 is about 63357.2837564869. The cubic root of 4014145405 is about 1589.2700531131.
Adding to 4014145405 its reverse (5045414104), we get a palindrome (9059559509).
The spelling of 4014145405 in words is "four billion, fourteen million, one hundred forty-five thousand, four hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •