Base | Representation |
---|---|
bin | 111111010000001… |
… | …010000110010000 |
3 | 2201221211120002210 |
4 | 333100022012100 |
5 | 4133131402042 |
6 | 253145112120 |
7 | 35204024226 |
oct | 7720120620 |
9 | 2657746083 |
10 | 1061200272 |
11 | 4a5024520 |
12 | 257488640 |
13 | 13bb17572 |
14 | a0d1cb16 |
15 | 6326ea9c |
hex | 3f40a190 |
1061200272 has 80 divisors (see below), whose sum is σ = 2997522432. Its totient is φ = 320837760.
The previous prime is 1061200267. The next prime is 1061200303. The reversal of 1061200272 is 2720021601.
It is a super-2 number, since 2×10612002722 = 2252292034585747968, which contains 22 as substring.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 255073 + ... + 259199.
Almost surely, 21061200272 is an apocalyptic number.
1061200272 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1061200272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1498761216).
1061200272 is an abundant number, since it is smaller than the sum of its proper divisors (1936322160).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1061200272 is a wasteful number, since it uses less digits than its factorization.
1061200272 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4636 (or 4630 counting only the distinct ones).
The product of its (nonzero) digits is 336, while the sum is 21.
The square root of 1061200272 is about 32576.0690077855. The cubic root of 1061200272 is about 1019.9975240232.
Adding to 1061200272 its reverse (2720021601), we get a palindrome (3781221873).
The spelling of 1061200272 in words is "one billion, sixty-one million, two hundred thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •