Base | Representation |
---|---|
bin | 111111110101001… |
… | …111010010001101 |
3 | 2202122010102020000 |
4 | 333311033102031 |
5 | 4143123431340 |
6 | 254133314513 |
7 | 35352451131 |
oct | 7765172215 |
9 | 2678112200 |
10 | 1070920845 |
11 | 4aa563755 |
12 | 25a795a39 |
13 | 140b3bb97 |
14 | a232d3c1 |
15 | 6403ed30 |
hex | 3fd4f48d |
1070920845 has 80 divisors (see below), whose sum is σ = 2090880000. Its totient is φ = 522329472.
The previous prime is 1070920817. The next prime is 1070920847. The reversal of 1070920845 is 5480290701.
It is not a de Polignac number, because 1070920845 - 27 = 1070920717 is a prime.
It is a super-2 number, since 2×10709208452 = 2293742912511028050, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1070920847) 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 79 ways as a sum of consecutive naturals, for example, 220756 + ... + 225554.
It is an arithmetic number, because the mean of its divisors is an integer number (26136000).
Almost surely, 21070920845 is an apocalyptic number.
1070920845 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
1070920845 is a deficient number, since it is larger than the sum of its proper divisors (1019959155).
1070920845 is a wasteful number, since it uses less digits than its factorization.
1070920845 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4864 (or 4855 counting only the distinct ones).
The product of its (nonzero) digits is 20160, while the sum is 36.
The square root of 1070920845 is about 32724.9269670690. The cubic root of 1070920845 is about 1023.1024484391.
The spelling of 1070920845 in words is "one billion, seventy million, nine hundred twenty thousand, eight hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •