Base | Representation |
---|---|
bin | 1010000010001101010000… |
… | …0001010100010011010001 |
3 | 1110001202012001022121111202 |
4 | 2200203110001110103101 |
5 | 2421231122440144332 |
6 | 35244301102120545 |
7 | 2216052563154326 |
oct | 240432401242321 |
9 | 43052161277452 |
10 | 11033033131217 |
11 | 35740a0632359 |
12 | 12a2338580155 |
13 | 620545000946 |
14 | 2a200476cb4d |
15 | 141edb71da62 |
hex | a08d40544d1 |
11033033131217 has 2 divisors, whose sum is σ = 11033033131218. Its totient is φ = 11033033131216.
The previous prime is 11033033131201. The next prime is 11033033131243. The reversal of 11033033131217 is 71213133033011.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10730924604481 + 302108526736 = 3275809^2 + 549644^2 .
It is a cyclic number.
It is not a de Polignac number, because 11033033131217 - 24 = 11033033131201 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 11033033131217.
It is not a weakly prime, because it can be changed into another prime (11033033131277) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5516516565608 + 5516516565609.
It is an arithmetic number, because the mean of its divisors is an integer number (5516516565609).
Almost surely, 211033033131217 is an apocalyptic number.
It is an amenable number.
11033033131217 is a deficient number, since it is larger than the sum of its proper divisors (1).
11033033131217 is an equidigital number, since it uses as much as digits as its factorization.
11033033131217 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3402, while the sum is 29.
Adding to 11033033131217 its reverse (71213133033011), we get a palindrome (82246166164228).
The spelling of 11033033131217 in words is "eleven trillion, thirty-three billion, thirty-three million, one hundred thirty-one thousand, two hundred seventeen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •