Base | Representation |
---|---|
bin | 111011101010101… |
… | …110011100100111 |
3 | 2120202122220201121 |
4 | 323222232130213 |
5 | 4022232243124 |
6 | 243200034411 |
7 | 33543556504 |
oct | 7352563447 |
9 | 2522586647 |
10 | 1001056039 |
11 | 474085245 |
12 | 23b302a07 |
13 | 12c519a69 |
14 | 96d444ab |
15 | 5cd3e2e4 |
hex | 3baae727 |
1001056039 has 8 divisors (see below), whose sum is σ = 1033406352. Its totient is φ = 969118080.
The previous prime is 1001055989. The next prime is 1001056087. The reversal of 1001056039 is 9306501001.
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 1001056039 - 213 = 1001047847 is a prime.
It is a super-2 number, since 2×10010560392 = 2004226386436739042, 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 (1001056099) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 98152 + ... + 107869.
It is an arithmetic number, because the mean of its divisors is an integer number (129175794).
Almost surely, 21001056039 is an apocalyptic number.
1001056039 is a deficient number, since it is larger than the sum of its proper divisors (32350313).
1001056039 is a wasteful number, since it uses less digits than its factorization.
1001056039 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 206177.
The product of its (nonzero) digits is 810, while the sum is 25.
The square root of 1001056039 is about 31639.4696384121. The cubic root of 1001056039 is about 1000.3518891595.
It can be divided in two parts, 10010 and 56039, that added together give a square (66049 = 2572).
The spelling of 1001056039 in words is "one billion, one million, fifty-six thousand, thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •