Base | Representation |
---|---|
bin | 101101101110101011100110… |
… | …111000101011101001010011 |
3 | 222101002212220110012222121221 |
4 | 231232223212320223221103 |
5 | 202330122241112033021 |
6 | 1551425131430225511 |
7 | 60235304251155652 |
oct | 5556534670535123 |
9 | 871085813188557 |
10 | 201120012221011 |
11 | 590a0577790174 |
12 | 1a6824a51b5297 |
13 | 882b6c7130540 |
14 | 3794390c75199 |
15 | 183b8d68c2241 |
hex | b6eae6e2ba53 |
201120012221011 has 8 divisors (see below), whose sum is σ = 216599713941744. Its totient is φ = 185641586436000.
The previous prime is 201120012220937. The next prime is 201120012221069. The reversal of 201120012221011 is 110122210021102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 201120012221011 - 223 = 201120003832403 is a prime.
It is a super-2 number, since 2×2011200122210112 (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 (201120012221911) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 318656536 + ... + 319287061.
It is an arithmetic number, because the mean of its divisors is an integer number (27074964242718).
Almost surely, 2201120012221011 is an apocalyptic number.
201120012221011 is a deficient number, since it is larger than the sum of its proper divisors (15479701720733).
201120012221011 is a wasteful number, since it uses less digits than its factorization.
201120012221011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 637967861.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 201120012221011 its reverse (110122210021102), we get a palindrome (311242222242113).
The spelling of 201120012221011 in words is "two hundred one trillion, one hundred twenty billion, twelve million, two hundred twenty-one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •