Base | Representation |
---|---|
bin | 1100001110110000110… |
… | …0000010111110110001 |
3 | 202002100200202022200011 |
4 | 3003230030002332301 |
5 | 11420311434323441 |
6 | 240310034254521 |
7 | 21115665061030 |
oct | 3035414027661 |
9 | 662320668604 |
10 | 210121011121 |
11 | 811259186aa |
12 | 34881127441 |
13 | 16a780c8858 |
14 | a254344717 |
15 | 56ebc87581 |
hex | 30ec302fb1 |
210121011121 has 4 divisors (see below), whose sum is σ = 240138298432. Its totient is φ = 180103723812.
The previous prime is 210121011119. The next prime is 210121011181. The reversal of 210121011121 is 121110121012.
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 210121011121 - 21 = 210121011119 is a prime.
It is a super-2 number, since 2×2101210111212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210121011181) 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, 15008643645 + ... + 15008643658.
It is an arithmetic number, because the mean of its divisors is an integer number (60034574608).
Almost surely, 2210121011121 is an apocalyptic number.
It is an amenable number.
210121011121 is a deficient number, since it is larger than the sum of its proper divisors (30017287311).
210121011121 is an equidigital number, since it uses as much as digits as its factorization.
210121011121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 30017287310.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 210121011121 its reverse (121110121012), we get a palindrome (331231132133).
The spelling of 210121011121 in words is "two hundred ten billion, one hundred twenty-one million, eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •