Base | Representation |
---|---|
bin | 10111001101110000000011… |
… | …011111010110110100011000 |
3 | 111101111200000000112022211200 |
4 | 113031300003133112310120 |
5 | 101340301320401041323 |
6 | 1001052034023154200 |
7 | 30335324463106146 |
oct | 2715600337266430 |
9 | 441450000468750 |
10 | 102100021112088 |
11 | 2a5944151a296a |
12 | b54b8025a5960 |
13 | 44c7cb569c3bc |
14 | 1b2d94b45a596 |
15 | bc0cc87a7443 |
hex | 5cdc037d6d18 |
102100021112088 has 48 divisors (see below), whose sum is σ = 283265302483800. Its totient is φ = 33203258897280.
The previous prime is 102100021112087. The next prime is 102100021112113. The reversal of 102100021112088 is 880211120001201.
It is a super-2 number, since 2×1021000211120882 (a number of 29 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100021112081) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 17293361058 + ... + 17293366961.
Almost surely, 2102100021112088 is an apocalyptic number.
102100021112088 is a gapful number since it is divisible by the number (18) formed by its first and last digit.
It is an amenable number.
102100021112088 is an abundant number, since it is smaller than the sum of its proper divisors (181165281371712).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102100021112088 is a wasteful number, since it uses less digits than its factorization.
102100021112088 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34586728072 (or 34586728065 counting only the distinct ones).
The product of its (nonzero) digits is 512, while the sum is 27.
Adding to 102100021112088 its reverse (880211120001201), we get a palindrome (982311141113289).
The spelling of 102100021112088 in words is "one hundred two trillion, one hundred billion, twenty-one million, one hundred twelve thousand, eighty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •