Base | Representation |
---|---|
bin | 101101101101001110011110… |
… | …111001011001101011100011 |
3 | 222100202022210211121010112020 |
4 | 231231032132321121223203 |
5 | 202322003000132432321 |
6 | 1551311153350232523 |
7 | 60225134332061160 |
oct | 5555163671315343 |
9 | 870668724533466 |
10 | 201020020202211 |
11 | 59062125906501 |
12 | 1a66703a055743 |
13 | 8822150186802 |
14 | 378d5c6cd1067 |
15 | 1838ed32124c6 |
hex | b6d39ee59ae3 |
201020020202211 has 32 divisors (see below), whose sum is σ = 330656190888960. Its totient is φ = 106085527895424.
The previous prime is 201020020202203. The next prime is 201020020202317. The reversal of 201020020202211 is 112202020020102.
It is not a de Polignac number, because 201020020202211 - 23 = 201020020202203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201020020201211) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 7175684580 + ... + 7175712593.
It is an arithmetic number, because the mean of its divisors is an integer number (10333005965280).
Almost surely, 2201020020202211 is an apocalyptic number.
201020020202211 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
201020020202211 is a deficient number, since it is larger than the sum of its proper divisors (129636170686749).
201020020202211 is a wasteful number, since it uses less digits than its factorization.
201020020202211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14351397235.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 201020020202211 its reverse (112202020020102), we get a palindrome (313222040222313).
The spelling of 201020020202211 in words is "two hundred one trillion, twenty billion, twenty million, two hundred two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •