Base | Representation |
---|---|
bin | 1010000001000011000111… |
… | …0100111010011001110001 |
3 | 1102222211211010000112121011 |
4 | 2200100301310322121301 |
5 | 2420414343304214413 |
6 | 35231210230030521 |
7 | 2214446452202623 |
oct | 240206164723161 |
9 | 42884733015534 |
10 | 11013132101233 |
11 | 3566708a60a39 |
12 | 129a5037a8441 |
13 | 61b6c2c98a62 |
14 | 2a107768ac13 |
15 | 14172450233d |
hex | a0431d3a671 |
11013132101233 has 2 divisors, whose sum is σ = 11013132101234. Its totient is φ = 11013132101232.
The previous prime is 11013132101197. The next prime is 11013132101243. The reversal of 11013132101233 is 33210123131011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7773769269904 + 3239362831329 = 2788148^2 + 1799823^2 .
It is a cyclic number.
It is not a de Polignac number, because 11013132101233 - 29 = 11013132100721 is a prime.
It is not a weakly prime, because it can be changed into another prime (11013132101243) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5506566050616 + 5506566050617.
It is an arithmetic number, because the mean of its divisors is an integer number (5506566050617).
Almost surely, 211013132101233 is an apocalyptic number.
It is an amenable number.
11013132101233 is a deficient number, since it is larger than the sum of its proper divisors (1).
11013132101233 is an equidigital number, since it uses as much as digits as its factorization.
11013132101233 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 324, while the sum is 22.
Adding to 11013132101233 its reverse (33210123131011), we get a palindrome (44223255232244).
The spelling of 11013132101233 in words is "eleven trillion, thirteen billion, one hundred thirty-two million, one hundred one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •