Base | Representation |
---|---|
bin | 101111110011000110101001… |
… | …101100000101111111110001 |
3 | 1000120022211121201120220100000 |
4 | 233303012221230011333301 |
5 | 210023221100412223441 |
6 | 2023033424452420213 |
7 | 62164616045265045 |
oct | 5763065154057761 |
9 | 1016284551526300 |
10 | 210220021211121 |
11 | 60a898a0604839 |
12 | 1b6b206b917669 |
13 | 903b88062994c |
14 | 39ca9bbc7c025 |
15 | 1948489eb22b6 |
hex | bf31a9b05ff1 |
210220021211121 has 12 divisors (see below), whose sum is σ = 314897480333072. Its totient is φ = 140146680807252.
The previous prime is 210220021211113. The next prime is 210220021211143. The reversal of 210220021211121 is 121112120022012.
210220021211121 is a `hidden beast` number, since 210 + 2 + 200 + 21 + 211 + 1 + 21 = 666.
It is not a de Polignac number, because 210220021211121 - 23 = 210220021211113 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 210220021211094 and 210220021211103.
It is not an unprimeable number, because it can be changed into a prime (210220021213121) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 432551483731 + ... + 432551484216.
Almost surely, 2210220021211121 is an apocalyptic number.
It is an amenable number.
210220021211121 is a deficient number, since it is larger than the sum of its proper divisors (104677459121951).
210220021211121 is an frugal number, since it uses more digits than its factorization.
210220021211121 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 865102967962 (or 865102967950 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 210220021211121 its reverse (121112120022012), we get a palindrome (331332141233133).
The spelling of 210220021211121 in words is "two hundred ten trillion, two hundred twenty billion, twenty-one million, two hundred eleven thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •