Base | Representation |
---|---|
bin | 10111001111011111111001… |
… | …111100101011001111000101 |
3 | 111101221010222220222112222020 |
4 | 113033133321330223033011 |
5 | 101344233301222010041 |
6 | 1001223135213353353 |
7 | 30350105603541234 |
oct | 2717377174531705 |
9 | 441833886875866 |
10 | 102220120110021 |
11 | 2a630344a24661 |
12 | b56ab3b498859 |
13 | 4506415239114 |
14 | 1b356a19b2b1b |
15 | bc3ea72b5866 |
hex | 5cf7f9f2b3c5 |
102220120110021 has 8 divisors (see below), whose sum is σ = 136293556295904. Its totient is φ = 68146715332080.
The previous prime is 102220120110011. The next prime is 102220120110023. The reversal of 102220120110021 is 120011021022201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102220120110021 - 221 = 102220118012869 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102220120110023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1249035 + ... + 14352711.
It is an arithmetic number, because the mean of its divisors is an integer number (17036694536988).
Almost surely, 2102220120110021 is an apocalyptic number.
It is an amenable number.
102220120110021 is a deficient number, since it is larger than the sum of its proper divisors (34073436185883).
102220120110021 is a wasteful number, since it uses less digits than its factorization.
102220120110021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15703971.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102220120110021 its reverse (120011021022201), we get a palindrome (222231141132222).
The spelling of 102220120110021 in words is "one hundred two trillion, two hundred twenty billion, one hundred twenty million, one hundred ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •