Base | Representation |
---|---|
bin | 10001011110100111010… |
… | …000111100000100100011 |
3 | 11020211020212112011001210 |
4 | 101132213100330010203 |
5 | 124134324120023021 |
6 | 2315440110401203 |
7 | 152530300330455 |
oct | 21364720740443 |
9 | 4224225464053 |
10 | 1201102111011 |
11 | 423425913440 |
12 | 174946800203 |
13 | 89356a274ba |
14 | 421c2a562d5 |
15 | 2139b83be76 |
hex | 117a743c123 |
1201102111011 has 32 divisors (see below), whose sum is σ = 1773574341120. Its totient is φ = 716914150400.
The previous prime is 1201102111007. The next prime is 1201102111049. The reversal of 1201102111011 is 1101112011021.
It is not a de Polignac number, because 1201102111011 - 22 = 1201102111007 is a prime.
It is not an unprimeable number, because it can be changed into a prime (1201102111061) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 1900741 + ... + 2452553.
It is an arithmetic number, because the mean of its divisors is an integer number (55424198160).
Almost surely, 21201102111011 is an apocalyptic number.
1201102111011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
1201102111011 is a deficient number, since it is larger than the sum of its proper divisors (572472230109).
1201102111011 is a wasteful number, since it uses less digits than its factorization.
1201102111011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 552827.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 1201102111011 its reverse (1101112011021), we get a palindrome (2302214122032).
It can be divided in two parts, 12011021 and 11011, that multiplied together give a palindrome (132253352231).
The spelling of 1201102111011 in words is "one trillion, two hundred one billion, one hundred two million, one hundred eleven thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •