Base | Representation |
---|---|
bin | 111111010000100… |
… | …001101011101000 |
3 | 2201222000110121120 |
4 | 333100201223220 |
5 | 4133142444442 |
6 | 253151135240 |
7 | 35204605656 |
oct | 7720415350 |
9 | 2658013546 |
10 | 1061296872 |
11 | 4a5090059 |
12 | 257514520 |
13 | 13bb4c51c |
14 | a0d45dd6 |
15 | 6328d4ec |
hex | 3f421ae8 |
1061296872 has 64 divisors (see below), whose sum is σ = 2679238080. Its totient is φ = 350318592.
The previous prime is 1061296871. The next prime is 1061296877. The reversal of 1061296872 is 2786921601.
1061296872 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×10612968722 = 2252702101033968768, which contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1061296871) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1839048 + ... + 1839624.
It is an arithmetic number, because the mean of its divisors is an integer number (41863095).
Almost surely, 21061296872 is an apocalyptic number.
1061296872 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
1061296872 is an abundant number, since it is smaller than the sum of its proper divisors (1617941208).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1061296872 is a wasteful number, since it uses less digits than its factorization.
1061296872 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1202 (or 1198 counting only the distinct ones).
The product of its (nonzero) digits is 72576, while the sum is 42.
The square root of 1061296872 is about 32577.5516575448. The cubic root of 1061296872 is about 1020.0284728692.
The spelling of 1061296872 in words is "one billion, sixty-one million, two hundred ninety-six thousand, eight hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •