Base | Representation |
---|---|
bin | 110111111011010010… |
… | …0111111101100101101 |
3 | 102111000001020110110202 |
4 | 1233312210333230231 |
5 | 3431431324311341 |
6 | 131101301243245 |
7 | 11451133512563 |
oct | 1576644775455 |
9 | 374001213422 |
10 | 120101010221 |
11 | 46a30986645 |
12 | 1b339703525 |
13 | b4300c292a |
14 | 5b5491ba33 |
15 | 31cdca979b |
hex | 1bf693fb2d |
120101010221 has 4 divisors (see below), whose sum is σ = 122656350912. Its totient is φ = 117545669532.
The previous prime is 120101010191. The next prime is 120101010223. The reversal of 120101010221 is 122010101021.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-120101010221 is a prime.
It is a super-2 number, since 2×1201010102212 (a number of 23 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 (120101010223) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1277670275 + ... + 1277670368.
It is an arithmetic number, because the mean of its divisors is an integer number (30664087728).
Almost surely, 2120101010221 is an apocalyptic number.
It is an amenable number.
120101010221 is a deficient number, since it is larger than the sum of its proper divisors (2555340691).
120101010221 is an equidigital number, since it uses as much as digits as its factorization.
120101010221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2555340690.
The product of its (nonzero) digits is 8, while the sum is 11.
Adding to 120101010221 its reverse (122010101021), we get a palindrome (242111111242).
The spelling of 120101010221 in words is "one hundred twenty billion, one hundred one million, ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •