Base | Representation |
---|---|
bin | 1100001010100… |
… | …00101010111100 |
3 | 21010000021201110 |
4 | 12011100222330 |
5 | 202110323200 |
6 | 14043042020 |
7 | 2346226263 |
oct | 605205274 |
9 | 233007643 |
10 | 102042300 |
11 | 52666988 |
12 | 2a210310 |
13 | 181aa279 |
14 | d7a35da |
15 | 8e59b50 |
hex | 6150abc |
102042300 has 144 divisors (see below), whose sum is σ = 314667360. Its totient is φ = 25482240.
The previous prime is 102042299. The next prime is 102042349. The reversal of 102042300 is 3240201.
It is a Harshad number since it is a multiple of its sum of digits (12).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 321742 + ... + 322058.
It is an arithmetic number, because the mean of its divisors is an integer number (2185190).
Almost surely, 2102042300 is an apocalyptic number.
102042300 is a gapful number since it is divisible by the number (10) 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 102042300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157333680).
102042300 is an abundant number, since it is smaller than the sum of its proper divisors (212625060).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102042300 is a wasteful number, since it uses less digits than its factorization.
102042300 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 400 (or 393 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 12.
The square root of 102042300 is about 10101.5988833452. The cubic root of 102042300 is about 467.2974519828.
Adding to 102042300 its reverse (3240201), we get a palindrome (105282501).
The spelling of 102042300 in words is "one hundred two million, forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •