Base | Representation |
---|---|
bin | 11110010000111010000111… |
… | …101001011110111110111011 |
3 | 122110021112220200121021121220 |
4 | 132100322013221132332323 |
5 | 114421231040422131021 |
6 | 1151030452330403123 |
7 | 40015253106064332 |
oct | 3620720751367673 |
9 | 573245820537556 |
10 | 133103312302011 |
11 | 39457885886587 |
12 | 12b18391b904a3 |
13 | 5936785bc342c |
14 | 24c233ddb4d19 |
15 | 105c4c8c09cc6 |
hex | 790e87a5efbb |
133103312302011 has 4 divisors (see below), whose sum is σ = 177471083069352. Its totient is φ = 88735541534672.
The previous prime is 133103312301991. The next prime is 133103312302021. The reversal of 133103312302011 is 110203213301331.
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 133103312302011 - 214 = 133103312285627 is a prime.
It is not an unprimeable number, because it can be changed into a prime (133103312302021) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 22183885383666 + ... + 22183885383671.
It is an arithmetic number, because the mean of its divisors is an integer number (44367770767338).
Almost surely, 2133103312302011 is an apocalyptic number.
133103312302011 is a deficient number, since it is larger than the sum of its proper divisors (44367770767341).
133103312302011 is an equidigital number, since it uses as much as digits as its factorization.
133103312302011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44367770767340.
The product of its (nonzero) digits is 972, while the sum is 24.
Adding to 133103312302011 its reverse (110203213301331), we get a palindrome (243306525603342).
The spelling of 133103312302011 in words is "one hundred thirty-three trillion, one hundred three billion, three hundred twelve million, three hundred two thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •