Base | Representation |
---|---|
bin | 11011010101010010011010… |
… | …001110001110010001111101 |
3 | 120202121222100210101202000000 |
4 | 123111102122032032101331 |
5 | 111224010322304201341 |
6 | 1103355434453024513 |
7 | 34214616064442022 |
oct | 3325223216162175 |
9 | 522558323352000 |
10 | 120210132100221 |
11 | 35336915776259 |
12 | 11595642025139 |
13 | 520c9c7908a07 |
14 | 21982b6a5d549 |
15 | dd6e1c37d8b6 |
hex | 6d549a38e47d |
120210132100221 has 56 divisors (see below), whose sum is σ = 185350973227200. Its totient is φ = 77883012478656.
The previous prime is 120210132100193. The next prime is 120210132100259. The reversal of 120210132100221 is 122001231012021.
120210132100221 is a `hidden beast` number, since 1 + 2 + 0 + 210 + 132 + 100 + 221 = 666.
It is not a de Polignac number, because 120210132100221 - 217 = 120210131969149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 120210132100194 and 120210132100203.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (120210132100921) by changing a digit.
It is a polite number, since it can be written in 55 ways as a sum of consecutive naturals, for example, 3397176 + ... + 15873281.
Almost surely, 2120210132100221 is an apocalyptic number.
It is an amenable number.
120210132100221 is a deficient number, since it is larger than the sum of its proper divisors (65140841126979).
120210132100221 is an equidigital number, since it uses as much as digits as its factorization.
120210132100221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19270717 (or 19270702 counting only the distinct ones).
The product of its (nonzero) digits is 96, while the sum is 18.
Adding to 120210132100221 its reverse (122001231012021), we get a palindrome (242211363112242).
The spelling of 120210132100221 in words is "one hundred twenty trillion, two hundred ten billion, one hundred thirty-two million, one hundred thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •