Base | Representation |
---|---|
bin | 10111001101110000000011… |
… | …100010101111101001011101 |
3 | 111101111200000002012110010111 |
4 | 113031300003202233221131 |
5 | 101340301321113001341 |
6 | 1001052034054210021 |
7 | 30335324503465360 |
oct | 2715600342575135 |
9 | 441450002173114 |
10 | 102100022000221 |
11 | 2a59441574a163 |
12 | b54b802953911 |
13 | 44c7cb592071b |
14 | 1b2d94b60c0d7 |
15 | bc0cc88d0681 |
hex | 5cdc038afa5d |
102100022000221 has 16 divisors (see below), whose sum is σ = 117086758312576. Its totient is φ = 87213783476736.
The previous prime is 102100022000159. The next prime is 102100022000237. The reversal of 102100022000221 is 122000220001201.
It is a happy number.
It is not a de Polignac number, because 102100022000221 - 213 = 102100021992029 is a prime.
It is a super-2 number, since 2×1021000220002212 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102100022000621) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 5085411 + ... + 15167776.
It is an arithmetic number, because the mean of its divisors is an integer number (7317922394536).
Almost surely, 2102100022000221 is an apocalyptic number.
It is an amenable number.
102100022000221 is a deficient number, since it is larger than the sum of its proper divisors (14986736312355).
102100022000221 is a wasteful number, since it uses less digits than its factorization.
102100022000221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20255668.
The product of its (nonzero) digits is 32, while the sum is 13.
Adding to 102100022000221 its reverse (122000220001201), we get a palindrome (224100242001422).
The spelling of 102100022000221 in words is "one hundred two trillion, one hundred billion, twenty-two million, two hundred twenty-one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.093 sec. • engine limits •