Base | Representation |
---|---|
bin | 111111110101011… |
… | …001110110011000 |
3 | 2202122012121120210 |
4 | 333311121312120 |
5 | 4143131322440 |
6 | 254134251120 |
7 | 35353021242 |
oct | 7765316630 |
9 | 2678177523 |
10 | 1070964120 |
11 | 4aa593216 |
12 | 25a7b6aa0 |
13 | 140b557a5 |
14 | a2341092 |
15 | 6404ca80 |
hex | 3fd59d98 |
1070964120 has 32 divisors (see below), whose sum is σ = 3212892720. Its totient is φ = 285590400.
The previous prime is 1070964109. The next prime is 1070964121. The reversal of 1070964120 is 214690701.
It is a happy number.
It is a super-2 number, since 2×10709641202 = 2293928292654748800, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1070964121) 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, 4462231 + ... + 4462470.
Almost surely, 21070964120 is an apocalyptic number.
1070964120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1070964120 is an abundant number, since it is smaller than the sum of its proper divisors (2141928600).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1070964120 is a wasteful number, since it uses less digits than its factorization.
1070964120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8924715 (or 8924711 counting only the distinct ones).
The product of its (nonzero) digits is 3024, while the sum is 30.
The square root of 1070964120 is about 32725.5881536146. The cubic root of 1070964120 is about 1023.1162291533.
The spelling of 1070964120 in words is "one billion, seventy million, nine hundred sixty-four thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •