Base | Representation |
---|---|
bin | 10111001101110000010110… |
… | …010001110010111110010100 |
3 | 111101111200210222122202222110 |
4 | 113031300112101302332110 |
5 | 101340302442044341000 |
6 | 1001052125203231020 |
7 | 30335335341264603 |
oct | 2715602621627624 |
9 | 441450728582873 |
10 | 102100336324500 |
11 | 2a594567117698 |
12 | b54b890078470 |
13 | 44c8035a95417 |
14 | 1b2d97b26da3a |
15 | bc0ce62bd850 |
hex | 5cdc16472f94 |
102100336324500 has 96 divisors (see below), whose sum is σ = 297318520437120. Its totient is φ = 27226541971200.
The previous prime is 102100336324489. The next prime is 102100336324513. The reversal of 102100336324500 is 5423633001201.
It is a Harshad number since it is a multiple of its sum of digits (30).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 310003912 + ... + 310333088.
It is an arithmetic number, because the mean of its divisors is an integer number (3097067921220).
Almost surely, 2102100336324500 is an apocalyptic number.
102100336324500 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
102100336324500 is an abundant number, since it is smaller than the sum of its proper divisors (195218184112620).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100336324500 is a wasteful number, since it uses less digits than its factorization.
102100336324500 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 535978 (or 535966 counting only the distinct ones).
The product of its (nonzero) digits is 12960, while the sum is 30.
Adding to 102100336324500 its reverse (5423633001201), we get a palindrome (107523969325701).
The spelling of 102100336324500 in words is "one hundred two trillion, one hundred billion, three hundred thirty-six million, three hundred twenty-four thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •