Base | Representation |
---|---|
bin | 1011101101100100011… |
… | …1100000110111100001 |
3 | 201020100202020000100020 |
4 | 2323121013200313201 |
5 | 11244040021333441 |
6 | 232233552344053 |
7 | 20352125211243 |
oct | 2733107406741 |
9 | 636322200306 |
10 | 201211121121 |
11 | 7837348344a |
12 | 32bb5245029 |
13 | 15c882085aa |
14 | 9a4aca8093 |
15 | 5379959e66 |
hex | 2ed91e0de1 |
201211121121 has 4 divisors (see below), whose sum is σ = 268281494832. Its totient is φ = 134140747412.
The previous prime is 201211121113. The next prime is 201211121123. The reversal of 201211121121 is 121121112102.
It is a happy number.
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 not a de Polignac number, because 201211121121 - 23 = 201211121113 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 201211121121.
It is not an unprimeable number, because it can be changed into a prime (201211121123) 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, 33535186851 + ... + 33535186856.
It is an arithmetic number, because the mean of its divisors is an integer number (67070373708).
Almost surely, 2201211121121 is an apocalyptic number.
It is an amenable number.
201211121121 is a deficient number, since it is larger than the sum of its proper divisors (67070373711).
201211121121 is an equidigital number, since it uses as much as digits as its factorization.
201211121121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 67070373710.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 201211121121 its reverse (121121112102), we get a palindrome (322332233223).
The spelling of 201211121121 in words is "two hundred one billion, two hundred eleven million, one hundred twenty-one thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •