Base | Representation |
---|---|
bin | 101111110001101010100001… |
… | …101101111000001010011011 |
3 | 1000112222101021221220221220210 |
4 | 233301222201231320022123 |
5 | 210020111004410310321 |
6 | 2022520145140422203 |
7 | 62154514550212431 |
oct | 5761524155701233 |
9 | 1015871257827823 |
10 | 210121103213211 |
11 | 60a5094aa10943 |
12 | 1b696a643a7963 |
13 | 9032448038b38 |
14 | 39c5cb67d2d51 |
15 | 1945aeac55b76 |
hex | bf1aa1b7829b |
210121103213211 has 8 divisors (see below), whose sum is σ = 280161691567120. Its totient is φ = 140080625167392.
The previous prime is 210121103213209. The next prime is 210121103213233. The reversal of 210121103213211 is 112312301121012.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 210121103213211 - 21 = 210121103213209 is a prime.
It is a super-3 number, since 3×2101211032132113 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210121103213291) 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, 23025016 + ... + 30828453.
It is an arithmetic number, because the mean of its divisors is an integer number (35020211445890).
Almost surely, 2210121103213211 is an apocalyptic number.
210121103213211 is a deficient number, since it is larger than the sum of its proper divisors (70040588353909).
210121103213211 is a wasteful number, since it uses less digits than its factorization.
210121103213211 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 55154045.
The product of its (nonzero) digits is 144, while the sum is 21.
Adding to 210121103213211 its reverse (112312301121012), we get a palindrome (322433404334223).
The spelling of 210121103213211 in words is "two hundred ten trillion, one hundred twenty-one billion, one hundred three million, two hundred thirteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •