Base | Representation |
---|---|
bin | 1100010011011… |
… | …00110110000000 |
3 | 21012012102101112 |
4 | 12021230312000 |
5 | 202410100042 |
6 | 14124022452 |
7 | 2362144631 |
oct | 611546600 |
9 | 235172345 |
10 | 103206272 |
11 | 53291444 |
12 | 2a691a28 |
13 | 184c7000 |
14 | d9c7888 |
15 | 90d9982 |
hex | 626cd80 |
103206272 has 64 divisors (see below), whose sum is σ = 223339200. Its totient is φ = 47503872.
The previous prime is 103206263. The next prime is 103206287. The reversal of 103206272 is 272602301.
It is a tau number, because it is divible by the number of its divisors (64).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 281033 + ... + 281399.
It is an arithmetic number, because the mean of its divisors is an integer number (3489675).
Almost surely, 2103206272 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 103206272, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (111669600).
103206272 is an abundant number, since it is smaller than the sum of its proper divisors (120132928).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103206272 is an frugal number, since it uses more digits than its factorization.
103206272 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 420 (or 382 counting only the distinct ones).
The product of its (nonzero) digits is 1008, while the sum is 23.
The square root of 103206272 is about 10159.0487743686. The cubic root of 103206272 is about 469.0675219469.
Adding to 103206272 its reverse (272602301), we get a palindrome (375808573).
The spelling of 103206272 in words is "one hundred three million, two hundred six thousand, two hundred seventy-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •