Base | Representation |
---|---|
bin | 111110000000100… |
… | …011001000110011 |
3 | 2200111120022021110 |
4 | 332000203020303 |
5 | 4112311100230 |
6 | 251121524403 |
7 | 34531445622 |
oct | 7600431063 |
9 | 2614508243 |
10 | 1040331315 |
11 | 494270351 |
12 | 2504a3703 |
13 | 1376bb77a |
14 | 9c2496b9 |
15 | 614eb4b0 |
hex | 3e023233 |
1040331315 has 16 divisors (see below), whose sum is σ = 1665305856. Its totient is φ = 554584800.
The previous prime is 1040331307. The next prime is 1040331319. The reversal of 1040331315 is 5131330401.
It is not a de Polignac number, because 1040331315 - 23 = 1040331307 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1040331291 and 1040331300.
It is not an unprimeable number, because it can be changed into a prime (1040331319) 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 15 ways as a sum of consecutive naturals, for example, 19660 + ... + 49670.
It is an arithmetic number, because the mean of its divisors is an integer number (104081616).
Almost surely, 21040331315 is an apocalyptic number.
1040331315 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
1040331315 is a deficient number, since it is larger than the sum of its proper divisors (624974541).
1040331315 is a wasteful number, since it uses less digits than its factorization.
1040331315 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32330.
The product of its (nonzero) digits is 540, while the sum is 21.
The square root of 1040331315 is about 32254.1674051587. The cubic root of 1040331315 is about 1013.2669805088.
Adding to 1040331315 its reverse (5131330401), we get a palindrome (6171661716).
The spelling of 1040331315 in words is "one billion, forty million, three hundred thirty-one thousand, three hundred fifteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •