Base | Representation |
---|---|
bin | 1100001010100… |
… | …01111000000000 |
3 | 21010000112111010 |
4 | 12011101320000 |
5 | 202111002412 |
6 | 14043120520 |
7 | 2346246540 |
oct | 605217000 |
9 | 233015433 |
10 | 102047232 |
11 | 5266a661 |
12 | 2a213140 |
13 | 181ac5a1 |
14 | d7a5320 |
15 | 8e5b33c |
hex | 6151e00 |
102047232 has 80 divisors (see below), whose sum is σ = 310730112. Its totient is φ = 29153280.
The previous prime is 102047227. The next prime is 102047261. The reversal of 102047232 is 232740201.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 102047199 and 102047208.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 6007 + ... + 15497.
Almost surely, 2102047232 is an apocalyptic number.
102047232 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 102047232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (155365056).
102047232 is an abundant number, since it is smaller than the sum of its proper divisors (208682880).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102047232 is an frugal number, since it uses more digits than its factorization.
102047232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9519 (or 9503 counting only the distinct ones).
The product of its (nonzero) digits is 672, while the sum is 21.
The square root of 102047232 is about 10101.8430001659. The cubic root of 102047232 is about 467.3049804748.
Adding to 102047232 its reverse (232740201), we get a palindrome (334787433).
The spelling of 102047232 in words is "one hundred two million, forty-seven thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •