Base | Representation |
---|---|
bin | 11011010101011100101001… |
… | …001010000111101010011101 |
3 | 120202200000201120021000102121 |
4 | 123111130221022013222131 |
5 | 111224200323221213041 |
6 | 1103404453052022541 |
7 | 34215455300060542 |
oct | 3325345112075235 |
9 | 522600646230377 |
10 | 120221120101021 |
11 | 35340544158955 |
12 | 115977a9a61a51 |
13 | 5210a591c1834 |
14 | 2198a3a0c8bc9 |
15 | dd7361d4c7d1 |
hex | 6d5729287a9d |
120221120101021 has 16 divisors (see below), whose sum is σ = 121926717020160. Its totient is φ = 118526365928880.
The previous prime is 120221120100973. The next prime is 120221120101031. The reversal of 120221120101021 is 120101021122021.
It is a cyclic number.
It is not a de Polignac number, because 120221120101021 - 239 = 119671364287133 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 120221120100986 and 120221120101004.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120221120101031) 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, 422476630 + ... + 422761096.
It is an arithmetic number, because the mean of its divisors is an integer number (7620419813760).
Almost surely, 2120221120101021 is an apocalyptic number.
It is an amenable number.
120221120101021 is a deficient number, since it is larger than the sum of its proper divisors (1705596919139).
120221120101021 is a wasteful number, since it uses less digits than its factorization.
120221120101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 303504.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 120221120101021 its reverse (120101021122021), we get a palindrome (240322141223042).
The spelling of 120221120101021 in words is "one hundred twenty trillion, two hundred twenty-one billion, one hundred twenty million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •