Base | Representation |
---|---|
bin | 10111001101110000010110… |
… | …000001011000100101110100 |
3 | 111101111200210200120012020111 |
4 | 113031300112001120211310 |
5 | 101340302434444202012 |
6 | 1001052124531112404 |
7 | 30335335256565343 |
oct | 2715602601304564 |
9 | 441450720505214 |
10 | 102100332022132 |
11 | 2a594564749214 |
12 | b54b88a742704 |
13 | 44c8034c1a042 |
14 | 1b2d97a86db5a |
15 | bc0ce5c1dba7 |
hex | 5cdc16058974 |
102100332022132 has 12 divisors (see below), whose sum is σ = 178678106876836. Its totient is φ = 51049444343040.
The previous prime is 102100332022127. The next prime is 102100332022133. The reversal of 102100332022132 is 231220233001201.
It can be written as a sum of positive squares in 2 ways, for example, as 7503622047076 + 94596709975056 = 2739274^2 + 9726084^2 .
It is a super-3 number, since 3×1021003320221323 (a number of 43 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100332022133) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 180098619 + ... + 180664642.
Almost surely, 2102100332022132 is an apocalyptic number.
It is an amenable number.
102100332022132 is a deficient number, since it is larger than the sum of its proper divisors (76577774854704).
102100332022132 is a wasteful number, since it uses less digits than its factorization.
102100332022132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 360834018 (or 360834016 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 102100332022132 its reverse (231220233001201), we get a palindrome (333320565023333).
The spelling of 102100332022132 in words is "one hundred two trillion, one hundred billion, three hundred thirty-two million, twenty-two thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •