Base | Representation |
---|---|
bin | 101111110011001000100101… |
… | …101010010010010110001001 |
3 | 1000120100000222200021211020100 |
4 | 233303020211222102112021 |
5 | 210023234330341042301 |
6 | 2023034411112120013 |
7 | 62165021432201433 |
oct | 5763104552222611 |
9 | 1016300880254210 |
10 | 210222101112201 |
11 | 60a8a768665252 |
12 | 1b6b2550396009 |
13 | 903bb224cb349 |
14 | 39cab381b5653 |
15 | 194855c8a9286 |
hex | bf3225a92589 |
210222101112201 has 12 divisors (see below), whose sum is σ = 303943065328240. Its totient is φ = 140014720049400.
The previous prime is 210222101112181. The next prime is 210222101112241. The reversal of 210222101112201 is 102211101222012.
210222101112201 is a `hidden beast` number, since 210 + 2 + 221 + 0 + 1 + 11 + 220 + 1 = 666.
It is not a de Polignac number, because 210222101112201 - 210 = 210222101111177 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (210222101112241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 11112269911 + ... + 11112288828.
Almost surely, 2210222101112201 is an apocalyptic number.
It is an amenable number.
210222101112201 is a deficient number, since it is larger than the sum of its proper divisors (93720964216039).
210222101112201 is a wasteful number, since it uses less digits than its factorization.
210222101112201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 22224559796 (or 22224559793 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 210222101112201 its reverse (102211101222012), we get a palindrome (312433202334213).
The spelling of 210222101112201 in words is "two hundred ten trillion, two hundred twenty-two billion, one hundred one million, one hundred twelve thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •