Base | Representation |
---|---|
bin | 111101100001100… |
… | …110110111010000 |
3 | 2122221022012210112 |
4 | 331201212313100 |
5 | 4103222020422 |
6 | 250232020452 |
7 | 34402504040 |
oct | 7541466720 |
9 | 2587265715 |
10 | 1032220112 |
11 | 48a730280 |
12 | 249831728 |
13 | 135b0b841 |
14 | 9b137720 |
15 | 60947ee2 |
hex | 3d866dd0 |
1032220112 has 80 divisors (see below), whose sum is σ = 2506660992. Its totient is φ = 400028160.
The previous prime is 1032220097. The next prime is 1032220177. The reversal of 1032220112 is 2110222301.
It is a happy number.
It is a super-3 number, since 3×10322201123 (a number of 28 digits) contains 333 as substring.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a congruent number.
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, 240578 + ... + 244830.
Almost surely, 21032220112 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 1032220112, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (1253330496).
1032220112 is an abundant number, since it is smaller than the sum of its proper divisors (1474440880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1032220112 is a wasteful number, since it uses less digits than its factorization.
1032220112 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4476 (or 4470 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 14.
The square root of 1032220112 is about 32128.1825194019. The cubic root of 1032220112 is about 1010.6267103465.
Adding to 1032220112 its reverse (2110222301), we get a palindrome (3142442413).
The spelling of 1032220112 in words is "one billion, thirty-two million, two hundred twenty thousand, one hundred twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •