Base | Representation |
---|---|
bin | 100001111110011… |
… | …1010000101001111 |
3 | 2221110012000220021 |
4 | 1003330322011033 |
5 | 4313322240030 |
6 | 305043003011 |
7 | 40152115552 |
oct | 10374720517 |
9 | 2843160807 |
10 | 1140040015 |
11 | 535582a34 |
12 | 279969467 |
13 | 15225c7ba |
14 | ab5a2699 |
15 | 6a14497a |
hex | 43f3a14f |
1140040015 has 4 divisors (see below), whose sum is σ = 1368048024. Its totient is φ = 912032008.
The previous prime is 1140039997. The next prime is 1140040049. The reversal of 1140040015 is 5100400411.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 5100400411 = 10847 ⋅470213.
It is a cyclic number.
It is not a de Polignac number, because 1140040015 - 25 = 1140039983 is a prime.
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 (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 114003997 + ... + 114004006.
It is an arithmetic number, because the mean of its divisors is an integer number (342012006).
Almost surely, 21140040015 is an apocalyptic number.
1140040015 is a deficient number, since it is larger than the sum of its proper divisors (228008009).
1140040015 is an equidigital number, since it uses as much as digits as its factorization.
1140040015 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 228008008.
The product of its (nonzero) digits is 80, while the sum is 16.
The square root of 1140040015 is about 33764.4785980770. The cubic root of 1140040015 is about 1044.6561493187.
Adding to 1140040015 its reverse (5100400411), we get a palindrome (6240440426).
It can be divided in two parts, 11400 and 40015, that added together give a palindrome (51415).
The spelling of 1140040015 in words is "one billion, one hundred forty million, forty thousand, fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •