Base | Representation |
---|---|
bin | 1100001111110… |
… | …00100100110000 |
3 | 21011022020010000 |
4 | 12013320210300 |
5 | 202244330112 |
6 | 14105510000 |
7 | 2355122316 |
oct | 607704460 |
9 | 234266100 |
10 | 102730032 |
11 | 52a96659 |
12 | 2a4a2300 |
13 | 1838b302 |
14 | d9020b6 |
15 | 90437dc |
hex | 61f8930 |
102730032 has 100 divisors (see below), whose sum is σ = 307041856. Its totient is φ = 33125760.
The previous prime is 102730027. The next prime is 102730049. The reversal of 102730032 is 230037201.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 102729987 and 102730014.
It is an unprimeable number.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 38898 + ... + 41454.
Almost surely, 2102730032 is an apocalyptic number.
102730032 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 102730032, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (153520928).
102730032 is an abundant number, since it is smaller than the sum of its proper divisors (204311824).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102730032 is a wasteful number, since it uses less digits than its factorization.
102730032 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2608 (or 2593 counting only the distinct ones).
The product of its (nonzero) digits is 252, while the sum is 18.
The square root of 102730032 is about 10135.5824696956. The cubic root of 102730032 is about 468.3449133912.
Adding to 102730032 its reverse (230037201), we get a palindrome (332767233).
The spelling of 102730032 in words is "one hundred two million, seven hundred thirty thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •