Base | Representation |
---|---|
bin | 111101111100110010… |
… | …0000111111001101011 |
3 | 110201101111201210112122 |
4 | 1323321210013321223 |
5 | 4134424204441321 |
6 | 141041011301455 |
7 | 12416520320441 |
oct | 1737144077153 |
9 | 421344653478 |
10 | 133036015211 |
11 | 514693a9310 |
12 | 219495aa88b |
13 | c711b88c38 |
14 | 66207a8b91 |
15 | 36d966d8ab |
hex | 1ef9907e6b |
133036015211 has 8 divisors (see below), whose sum is σ = 145205379648. Its totient is φ = 120879181000.
The previous prime is 133036015193. The next prime is 133036015213. The reversal of 133036015211 is 112510630331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-133036015211 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (133036015213) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3110345 + ... + 3152826.
It is an arithmetic number, because the mean of its divisors is an integer number (18150672456).
Almost surely, 2133036015211 is an apocalyptic number.
133036015211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
133036015211 is a deficient number, since it is larger than the sum of its proper divisors (12169364437).
133036015211 is a wasteful number, since it uses less digits than its factorization.
133036015211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6265113.
The product of its (nonzero) digits is 1620, while the sum is 26.
Adding to 133036015211 its reverse (112510630331), we get a palindrome (245546645542).
The spelling of 133036015211 in words is "one hundred thirty-three billion, thirty-six million, fifteen thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •