Base | Representation |
---|---|
bin | 111110000001001… |
… | …111000100001001 |
3 | 2200111220110002101 |
4 | 332001033010021 |
5 | 4112332324431 |
6 | 251125433401 |
7 | 34533125320 |
oct | 7601170411 |
9 | 2614813071 |
10 | 1040511241 |
11 | 494383550 |
12 | 25056b861 |
13 | 137752633 |
14 | 9c2950b7 |
15 | 61534961 |
hex | 3e04f109 |
1040511241 has 8 divisors (see below), whose sum is σ = 1297260864. Its totient is φ = 810787920.
The previous prime is 1040511233. The next prime is 1040511257. The reversal of 1040511241 is 1421150401.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1040511241 - 23 = 1040511233 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1040511281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6756490 + ... + 6756643.
It is an arithmetic number, because the mean of its divisors is an integer number (162157608).
Almost surely, 21040511241 is an apocalyptic number.
1040511241 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
1040511241 is a deficient number, since it is larger than the sum of its proper divisors (256749623).
1040511241 is a wasteful number, since it uses less digits than its factorization.
1040511241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13513151.
The product of its (nonzero) digits is 160, while the sum is 19.
The square root of 1040511241 is about 32256.9564745343. The cubic root of 1040511241 is about 1013.3253922099.
Adding to 1040511241 its reverse (1421150401), we get a palindrome (2461661642).
The spelling of 1040511241 in words is "one billion, forty million, five hundred eleven thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •