Base | Representation |
---|---|
bin | 111110000000100… |
… | …011001010101001 |
3 | 2200111120022102211 |
4 | 332000203022221 |
5 | 4112311101213 |
6 | 251121525121 |
7 | 34531446151 |
oct | 7600431251 |
9 | 2614508384 |
10 | 1040331433 |
11 | 494270449 |
12 | 2504a37a1 |
13 | 1376bb83b |
14 | 9c249761 |
15 | 614eb53d |
hex | 3e0232a9 |
1040331433 has 4 divisors (see below), whose sum is σ = 1040755600. Its totient is φ = 1039907268.
The previous prime is 1040331419. The next prime is 1040331443. The reversal of 1040331433 is 3341330401.
It is a happy number.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 1040331433 - 213 = 1040323241 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1040331403) 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 3 ways as a sum of consecutive naturals, for example, 208383 + ... + 213316.
It is an arithmetic number, because the mean of its divisors is an integer number (260188900).
Almost surely, 21040331433 is an apocalyptic number.
It is an amenable number.
1040331433 is a deficient number, since it is larger than the sum of its proper divisors (424167).
1040331433 is an equidigital number, since it uses as much as digits as its factorization.
1040331433 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 424166.
The product of its (nonzero) digits is 1296, while the sum is 22.
The square root of 1040331433 is about 32254.1692343796. The cubic root of 1040331433 is about 1013.2670188189.
Adding to 1040331433 its reverse (3341330401), we get a palindrome (4381661834).
The spelling of 1040331433 in words is "one billion, forty million, three hundred thirty-one thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •