Base | Representation |
---|---|
bin | 11110010000111010000001… |
… | …101111000110111010110011 |
3 | 122110021112122202221221220020 |
4 | 132100322001233012322303 |
5 | 114421230340024104021 |
6 | 1151030434424414523 |
7 | 40015250463020511 |
oct | 3620720157067263 |
9 | 573245582857806 |
10 | 133103213113011 |
11 | 394578348993a9 |
12 | 12b18364917443 |
13 | 593676b4a4b0b |
14 | 24c2330b554b1 |
15 | 105c4c01657c6 |
hex | 790e81bc6eb3 |
133103213113011 has 4 divisors (see below), whose sum is σ = 177470950817352. Its totient is φ = 88735475408672.
The previous prime is 133103213112997. The next prime is 133103213113051. The reversal of 133103213113011 is 110311312301331.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 133103213113011 - 210 = 133103213111987 is a prime.
It is a super-2 number, since 2×1331032131130112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (133103213113051) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22183868852166 + ... + 22183868852171.
It is an arithmetic number, because the mean of its divisors is an integer number (44367737704338).
Almost surely, 2133103213113011 is an apocalyptic number.
133103213113011 is a deficient number, since it is larger than the sum of its proper divisors (44367737704341).
133103213113011 is an equidigital number, since it uses as much as digits as its factorization.
133103213113011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44367737704340.
The product of its (nonzero) digits is 486, while the sum is 24.
Adding to 133103213113011 its reverse (110311312301331), we get a palindrome (243414525414342).
The spelling of 133103213113011 in words is "one hundred thirty-three trillion, one hundred three billion, two hundred thirteen million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.106 sec. • engine limits •