Base | Representation |
---|---|
bin | 101111101001100000… |
… | …0011000111000011100 |
3 | 100210010011022011110120 |
4 | 1133103000120320130 |
5 | 3134030012423200 |
6 | 115001313434540 |
7 | 10251456362445 |
oct | 1372300307034 |
9 | 323104264416 |
10 | 102324342300 |
11 | 3a439472954 |
12 | 179b826ba50 |
13 | 985922860b |
14 | 4d49a282cc |
15 | 29dd3189a0 |
hex | 17d3018e1c |
102324342300 has 144 divisors (see below), whose sum is σ = 314727772800. Its totient is φ = 25594272000.
The previous prime is 102324342299. The next prime is 102324342311. The reversal of 102324342300 is 3243423201.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 486831 + ... + 664569.
Almost surely, 2102324342300 is an apocalyptic number.
102324342300 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 102324342300, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (157363886400).
102324342300 is an abundant number, since it is smaller than the sum of its proper divisors (212403430500).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102324342300 is a wasteful number, since it uses less digits than its factorization.
102324342300 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 177876 (or 177869 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 24.
Adding to 102324342300 its reverse (3243423201), we get a palindrome (105567765501).
The spelling of 102324342300 in words is "one hundred two billion, three hundred twenty-four million, three hundred forty-two thousand, three hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •