Base | Representation |
---|---|
bin | 101101101101000110010001… |
… | …001011000101011011000011 |
3 | 222100201111001010212120011220 |
4 | 231231012101023011123003 |
5 | 202321331414201202321 |
6 | 1551303134231210123 |
7 | 60224402631555525 |
oct | 5555062113053303 |
9 | 870644033776156 |
10 | 201011200022211 |
11 | 5905940a074747 |
12 | 1a665398216943 |
13 | 8821375a464a7 |
14 | 378cdcb727a15 |
15 | 1838b68c059c6 |
hex | b6d1912c56c3 |
201011200022211 has 32 divisors (see below), whose sum is σ = 277624686643200. Its totient is φ = 129233326467840.
The previous prime is 201011200022203. The next prime is 201011200022219. The reversal of 201011200022211 is 112220002110102.
It is an interprime number because it is at equal distance from previous prime (201011200022203) and next prime (201011200022219).
It is not a de Polignac number, because 201011200022211 - 23 = 201011200022203 is a prime.
It is not an unprimeable number, because it can be changed into a prime (201011200022219) 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 31 ways as a sum of consecutive naturals, for example, 37153660 + ... + 42218678.
It is an arithmetic number, because the mean of its divisors is an integer number (8675771457600).
Almost surely, 2201011200022211 is an apocalyptic number.
201011200022211 is a deficient number, since it is larger than the sum of its proper divisors (76613486620989).
201011200022211 is a wasteful number, since it uses less digits than its factorization.
201011200022211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5066539.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 201011200022211 its reverse (112220002110102), we get a palindrome (313231202132313).
The spelling of 201011200022211 in words is "two hundred one trillion, eleven billion, two hundred million, twenty-two thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •