Base | Representation |
---|---|
bin | 111100000000001… |
… | …001010100100101 |
3 | 2121011020012012100 |
4 | 330000021110211 |
5 | 4030201434031 |
6 | 243520242313 |
7 | 33642364200 |
oct | 7400112445 |
9 | 2534205170 |
10 | 1006671141 |
11 | 47726aa23 |
12 | 241170399 |
13 | 1307347c8 |
14 | 979a6937 |
15 | 5d59cde6 |
hex | 3c009525 |
1006671141 has 72 divisors (see below), whose sum is σ = 1733246424. Its totient is φ = 561254400.
The previous prime is 1006671131. The next prime is 1006671143. The reversal of 1006671141 is 1411766001.
It can be written as a sum of positive squares in 4 ways, for example, as 232440516 + 774230625 = 15246^2 + 27825^2 .
It is not a de Polignac number, because 1006671141 - 27 = 1006671013 is a prime.
It is a super-2 number, since 2×10066711412 = 2026773572244483762, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1006671143) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 4320361 + ... + 4320593.
It is an arithmetic number, because the mean of its divisors is an integer number (24072867).
Almost surely, 21006671141 is an apocalyptic number.
It is an amenable number.
1006671141 is a deficient number, since it is larger than the sum of its proper divisors (726575283).
1006671141 is a wasteful number, since it uses less digits than its factorization.
1006671141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 451 (or 441 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 27.
The square root of 1006671141 is about 31728.0812688067. The cubic root of 1006671141 is about 1002.2187870098.
The spelling of 1006671141 in words is "one billion, six million, six hundred seventy-one thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •