Base | Representation |
---|---|
bin | 10111001100100110110001… |
… | …001101100101011010011000 |
3 | 111101020010212222210012210220 |
4 | 113030212301031211122120 |
5 | 101333004141303411412 |
6 | 1000551541431440040 |
7 | 30326540460611205 |
oct | 2714466115453230 |
9 | 441203788705726 |
10 | 102021331310232 |
11 | 2a56400491a074 |
12 | b538501526020 |
13 | 44c0754b33379 |
14 | 1b29c046d8cac |
15 | bbdc2034068c |
hex | 5cc9b1365698 |
102021331310232 has 32 divisors (see below), whose sum is σ = 255157987153200. Its totient is φ = 33993155919744.
The previous prime is 102021331310219. The next prime is 102021331310279. The reversal of 102021331310232 is 232013133120201.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 872097607 + ... + 872214582.
Almost surely, 2102021331310232 is an apocalyptic number.
102021331310232 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102021331310232 is an abundant number, since it is smaller than the sum of its proper divisors (153136655842968).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102021331310232 is a wasteful number, since it uses less digits than its factorization.
102021331310232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1744314635 (or 1744314631 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 24.
Adding to 102021331310232 its reverse (232013133120201), we get a palindrome (334034464430433).
The spelling of 102021331310232 in words is "one hundred two trillion, twenty-one billion, three hundred thirty-one million, three hundred ten thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •