Base | Representation |
---|---|
bin | 1100010010000… |
… | …10010100100110 |
3 | 21011212120110210 |
4 | 12021002110212 |
5 | 202334011402 |
6 | 14120200250 |
7 | 2360521065 |
oct | 611022446 |
9 | 234776423 |
10 | 103032102 |
11 | 531825a8 |
12 | 2a609086 |
13 | 18465954 |
14 | d9801dc |
15 | 90a306c |
hex | 6242526 |
103032102 has 8 divisors (see below), whose sum is σ = 206064216. Its totient is φ = 34344032.
The previous prime is 103032101. The next prime is 103032103. The reversal of 103032102 is 201230301.
It is a happy number.
It is an interprime number because it is at equal distance from previous prime (103032101) and next prime (103032103).
It is a sphenic number, since it is the product of 3 distinct primes.
103032102 is an admirable number.
It is a super-2 number, since 2×1030321022 = 21231228085076808, which contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (103032101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8586003 + ... + 8586014.
It is an arithmetic number, because the mean of its divisors is an integer number (25758027).
Almost surely, 2103032102 is an apocalyptic number.
103032102 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
103032102 is a wasteful number, since it uses less digits than its factorization.
103032102 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 17172022.
The product of its (nonzero) digits is 36, while the sum is 12.
The square root of 103032102 is about 10150.4729939053. The cubic root of 103032102 is about 468.8035086294.
Adding to 103032102 its reverse (201230301), we get a palindrome (304262403).
The spelling of 103032102 in words is "one hundred three million, thirty-two thousand, one hundred two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.021 sec. • engine limits •