Base | Representation |
---|---|
bin | 11110010001000001011001… |
… | …001001111010110011011011 |
3 | 122110022022001222022201022202 |
4 | 132101001121021322303123 |
5 | 114421343034241210021 |
6 | 1151034223320040415 |
7 | 40015650461154401 |
oct | 3621013111726333 |
9 | 573268058281282 |
10 | 133111122210011 |
11 | 39460123319000 |
12 | 12b199b160310b |
13 | 593742bc3ac7a |
14 | 24c2881319471 |
15 | 105c7d46a6a0b |
hex | 79105927acdb |
133111122210011 has 16 divisors (see below), whose sum is σ = 154118140656000. Its totient is φ = 114641157862440.
The previous prime is 133111122209987. The next prime is 133111122210019. The reversal of 133111122210011 is 110012221111331.
It is not a de Polignac number, because 133111122210011 - 238 = 132836244303067 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133111122210019) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 2631773561 + ... + 2631824138.
It is an arithmetic number, because the mean of its divisors is an integer number (9632383791000).
Almost surely, 2133111122210011 is an apocalyptic number.
133111122210011 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133111122210011 is a deficient number, since it is larger than the sum of its proper divisors (21007018445989).
133111122210011 is an equidigital number, since it uses as much as digits as its factorization.
133111122210011 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5263597751 (or 5263597729 counting only the distinct ones).
The product of its (nonzero) digits is 72, while the sum is 20.
Adding to 133111122210011 its reverse (110012221111331), we get a palindrome (243123343321342).
The spelling of 133111122210011 in words is "one hundred thirty-three trillion, one hundred eleven billion, one hundred twenty-two million, two hundred ten thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •