Base | Representation |
---|---|
bin | 1100010010000… |
… | …10010011001100 |
3 | 21011212120100110 |
4 | 12021002103030 |
5 | 202334011022 |
6 | 14120200020 |
7 | 2360520606 |
oct | 611022314 |
9 | 234776313 |
10 | 103032012 |
11 | 53182526 |
12 | 2a609010 |
13 | 184658b5 |
14 | d980176 |
15 | 90a300c |
hex | 62424cc |
103032012 has 48 divisors (see below), whose sum is σ = 251112960. Its totient is φ = 32837952.
The previous prime is 103031959. The next prime is 103032029. The reversal of 103032012 is 210230301.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (12).
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, 35853 + ... + 38619.
It is an arithmetic number, because the mean of its divisors is an integer number (5231520).
Almost surely, 2103032012 is an apocalyptic number.
103032012 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 103032012, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (125556480).
103032012 is an abundant number, since it is smaller than the sum of its proper divisors (148080948).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103032012 is a wasteful number, since it uses less digits than its factorization.
103032012 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2910 (or 2908 counting only the distinct ones).
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 103032012 is about 10150.4685606133. The cubic root of 103032012 is about 468.8033721272.
Adding to 103032012 its reverse (210230301), we get a palindrome (313262313).
The spelling of 103032012 in words is "one hundred three million, thirty-two thousand, twelve".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •