Base | Representation |
---|---|
bin | 111110000001011… |
… | …000110000010101 |
3 | 2200111222110112110 |
4 | 332001120300111 |
5 | 4112340112213 |
6 | 251130341233 |
7 | 34533352122 |
oct | 7601306025 |
9 | 2614873473 |
10 | 1040550933 |
11 | 494400354 |
12 | 25058a819 |
13 | 137767716 |
14 | 9c2a5749 |
15 | 615415c3 |
hex | 3e058c15 |
1040550933 has 4 divisors (see below), whose sum is σ = 1387401248. Its totient is φ = 693700620.
The previous prime is 1040550923. The next prime is 1040550971. The reversal of 1040550933 is 3390550401.
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 not a de Polignac number, because 1040550933 - 28 = 1040550677 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1040550933.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1040550923) 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, 173425153 + ... + 173425158.
It is an arithmetic number, because the mean of its divisors is an integer number (346850312).
Almost surely, 21040550933 is an apocalyptic number.
It is an amenable number.
1040550933 is a deficient number, since it is larger than the sum of its proper divisors (346850315).
1040550933 is an equidigital number, since it uses as much as digits as its factorization.
1040550933 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 346850314.
The product of its (nonzero) digits is 8100, while the sum is 30.
The square root of 1040550933 is about 32257.5717158003. The cubic root of 1040550933 is about 1013.3382770299.
The spelling of 1040550933 in words is "one billion, forty million, five hundred fifty thousand, nine hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.278 sec. • engine limits •