Base | Representation |
---|---|
bin | 101111110001101010100010… |
… | …000111110011110101001011 |
3 | 1000112222101022102201100000120 |
4 | 233301222202013303311023 |
5 | 210020111013130324321 |
6 | 2022520145542234323 |
7 | 62154514662044610 |
oct | 5761524207636513 |
9 | 1015871272640016 |
10 | 210121110011211 |
11 | 60a50953834323 |
12 | 1b696a667259a3 |
13 | 9032449579119 |
14 | 39c5cb7682507 |
15 | 1945aeb649ec6 |
hex | bf1aa21f3d4b |
210121110011211 has 8 divisors (see below), whose sum is σ = 320184548588544. Its totient is φ = 120069205720680.
The previous prime is 210121110011207. The next prime is 210121110011291. The reversal of 210121110011211 is 112110011121012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210121110011211 - 22 = 210121110011207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (210121110011291) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5002883571675 + ... + 5002883571716.
It is an arithmetic number, because the mean of its divisors is an integer number (40023068573568).
Almost surely, 2210121110011211 is an apocalyptic number.
210121110011211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
210121110011211 is a deficient number, since it is larger than the sum of its proper divisors (110063438577333).
210121110011211 is a wasteful number, since it uses less digits than its factorization.
210121110011211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 10005767143401.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 210121110011211 its reverse (112110011121012), we get a palindrome (322231121132223).
The spelling of 210121110011211 in words is "two hundred ten trillion, one hundred twenty-one billion, one hundred ten million, eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •