Base | Representation |
---|---|
bin | 101101101101000110010001… |
… | …010011011011100110100011 |
3 | 222100201111001021222201112221 |
4 | 231231012101103123212203 |
5 | 202321331420231211321 |
6 | 1551303134350131511 |
7 | 60224402656300531 |
oct | 5555062123334643 |
9 | 870644037881487 |
10 | 201011202210211 |
11 | 59059410329608 |
12 | 1a665398ab0b97 |
13 | 8821376331373 |
14 | 378cdcbb37151 |
15 | 1838b68ed8e41 |
hex | b6d1914db9a3 |
201011202210211 has 4 divisors (see below), whose sum is σ = 201012251635800. Its totient is φ = 201010152784624.
The previous prime is 201011202210199. The next prime is 201011202210241. The reversal of 201011202210211 is 112012202110102.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 201011202210211 - 235 = 200976842471843 is a prime.
It is a super-2 number, since 2×2010112022102112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (201011202210241) 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, 524425426 + ... + 524808583.
It is an arithmetic number, because the mean of its divisors is an integer number (50253062908950).
Almost surely, 2201011202210211 is an apocalyptic number.
201011202210211 is a deficient number, since it is larger than the sum of its proper divisors (1049425589).
201011202210211 is a wasteful number, since it uses less digits than its factorization.
201011202210211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049425588.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201011202210211 its reverse (112012202110102), we get a palindrome (313023404320313).
The spelling of 201011202210211 in words is "two hundred one trillion, eleven billion, two hundred two million, two hundred ten thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •