Base | Representation |
---|---|
bin | 1011101101100100111… |
… | …1111100101000101011 |
3 | 201020100220101100010001 |
4 | 2323121033330220223 |
5 | 11244041103111021 |
6 | 232234112003431 |
7 | 20352153050056 |
oct | 2733117745053 |
9 | 636326340101 |
10 | 201213332011 |
11 | 7837475352a |
12 | 32bb5b30577 |
13 | 15c88800a03 |
14 | 9a4b2c1a9d |
15 | 5379c45091 |
hex | 2ed93fca2b |
201213332011 has 12 divisors (see below), whose sum is σ = 219683685600. Its totient is φ = 184049934768.
The previous prime is 201213332009. The next prime is 201213332017. The reversal of 201213332011 is 110233312102.
It is not a de Polignac number, because 201213332011 - 21 = 201213332009 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (19).
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 201213332011.
It is not an unprimeable number, because it can be changed into a prime (201213332017) 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, 9599491 + ... + 9620428.
It is an arithmetic number, because the mean of its divisors is an integer number (18306973800).
Almost surely, 2201213332011 is an apocalyptic number.
201213332011 is a deficient number, since it is larger than the sum of its proper divisors (18470353589).
201213332011 is a wasteful number, since it uses less digits than its factorization.
201213332011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19219986 (or 19219967 counting only the distinct ones).
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 201213332011 its reverse (110233312102), we get a palindrome (311446644113).
The spelling of 201213332011 in words is "two hundred one billion, two hundred thirteen million, three hundred thirty-two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •