Base | Representation |
---|---|
bin | 1010000010001110010000… |
… | …0011000101011100110101 |
3 | 1110001202212210022002110212 |
4 | 2200203210003011130311 |
5 | 2421232200304431013 |
6 | 35244343505355205 |
7 | 2216062336601225 |
oct | 240434403053465 |
9 | 43052783262425 |
10 | 11033302030133 |
11 | 35742193a4069 |
12 | 12a23b2638b05 |
13 | 62058892c526 |
14 | 2a202c368085 |
15 | 1420051376a8 |
hex | a08e40c5735 |
11033302030133 has 8 divisors (see below), whose sum is σ = 11053632858240. Its totient is φ = 11012971788000.
The previous prime is 11033302030123. The next prime is 11033302030147. The reversal of 11033302030133 is 33103020333011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 11033302030133 - 214 = 11033302013749 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 11033302030099 and 11033302030108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (11033302030123) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 60866633 + ... + 61047633.
It is an arithmetic number, because the mean of its divisors is an integer number (1381704107280).
Almost surely, 211033302030133 is an apocalyptic number.
It is an amenable number.
11033302030133 is a deficient number, since it is larger than the sum of its proper divisors (20330828107).
11033302030133 is a wasteful number, since it uses less digits than its factorization.
11033302030133 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 292987.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 11033302030133 its reverse (33103020333011), we get a palindrome (44136322363144).
The spelling of 11033302030133 in words is "eleven trillion, thirty-three billion, three hundred two million, thirty thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •