Base | Representation |
---|---|
bin | 111110111110000… |
… | …000110001110101 |
3 | 2201121212220001101 |
4 | 332332000301311 |
5 | 4130422143014 |
6 | 252455130101 |
7 | 35115423142 |
oct | 7676006165 |
9 | 2647786041 |
10 | 1056443509 |
11 | 4a2375710 |
12 | 255973931 |
13 | 13ab40404 |
14 | a04413c9 |
15 | 62b30474 |
hex | 3ef80c75 |
1056443509 has 4 divisors (see below), whose sum is σ = 1152483840. Its totient is φ = 960403180.
The previous prime is 1056443497. The next prime is 1056443533. The reversal of 1056443509 is 9053446501.
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 1056443509 - 221 = 1054346357 is a prime.
It is a super-2 number, since 2×10564435092 = 2232145775416466162, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056443539) by changing a digit.
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, 48020149 + ... + 48020170.
It is an arithmetic number, because the mean of its divisors is an integer number (288120960).
Almost surely, 21056443509 is an apocalyptic number.
It is an amenable number.
1056443509 is a deficient number, since it is larger than the sum of its proper divisors (96040331).
1056443509 is an equidigital number, since it uses as much as digits as its factorization.
1056443509 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 96040330.
The product of its (nonzero) digits is 64800, while the sum is 37.
The square root of 1056443509 is about 32502.9769251987. The cubic root of 1056443509 is about 1018.4712164568.
The spelling of 1056443509 in words is "one billion, fifty-six million, four hundred forty-three thousand, five hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.122 sec. • engine limits •