Base | Representation |
---|---|
bin | 10100111000101100… |
… | …10101011000011001 |
3 | 1001221110022012100211 |
4 | 22130112111120121 |
5 | 140431014110113 |
6 | 5052354131121 |
7 | 544604140144 |
oct | 123426253031 |
9 | 31843265324 |
10 | 11213035033 |
11 | 4834514202 |
12 | 220b280aa1 |
13 | 10990c6a95 |
14 | 7852c705b |
15 | 459620b3d |
hex | 29c595619 |
11213035033 has 2 divisors, whose sum is σ = 11213035034. Its totient is φ = 11213035032.
The previous prime is 11213035021. The next prime is 11213035039. The reversal of 11213035033 is 33053031211.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 9400659849 + 1812375184 = 96957^2 + 42572^2 .
It is an emirp because it is prime and its reverse (33053031211) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 11213035033 - 213 = 11213026841 is a prime.
It is a super-2 number, since 2×112130350332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11213034995 and 11213035013.
It is not a weakly prime, because it can be changed into another prime (11213035039) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5606517516 + 5606517517.
It is an arithmetic number, because the mean of its divisors is an integer number (5606517517).
Almost surely, 211213035033 is an apocalyptic number.
It is an amenable number.
11213035033 is a deficient number, since it is larger than the sum of its proper divisors (1).
11213035033 is an equidigital number, since it uses as much as digits as its factorization.
11213035033 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 810, while the sum is 22.
Adding to 11213035033 its reverse (33053031211), we get a palindrome (44266066244).
The spelling of 11213035033 in words is "eleven billion, two hundred thirteen million, thirty-five thousand, thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •