Base | Representation |
---|---|
bin | 111111110100010… |
… | …101001000011000 |
3 | 2202121200022110220 |
4 | 333310111020120 |
5 | 4143043321043 |
6 | 254124240040 |
7 | 35350436520 |
oct | 7764251030 |
9 | 2677608426 |
10 | 1070682648 |
11 | 4aa4107a2 |
12 | 25a6a0020 |
13 | 140a87639 |
14 | a22aa680 |
15 | 63ee4483 |
hex | 3fd15218 |
1070682648 has 32 divisors (see below), whose sum is σ = 3059093760. Its totient is φ = 305909280.
The previous prime is 1070682643. The next prime is 1070682659. The reversal of 1070682648 is 8462860701.
1070682648 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10706826482 = 2292722665456583808, which contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (42).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1070682643) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3186388 + ... + 3186723.
It is an arithmetic number, because the mean of its divisors is an integer number (95596680).
Almost surely, 21070682648 is an apocalyptic number.
It is an amenable number.
1070682648 is an abundant number, since it is smaller than the sum of its proper divisors (1988411112).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1070682648 is a wasteful number, since it uses less digits than its factorization.
1070682648 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6373127 (or 6373123 counting only the distinct ones).
The product of its (nonzero) digits is 129024, while the sum is 42.
The square root of 1070682648 is about 32721.2873829866. The cubic root of 1070682648 is about 1023.0265891120.
The spelling of 1070682648 in words is "one billion, seventy million, six hundred eighty-two thousand, six hundred forty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •