Base | Representation |
---|---|
bin | 10100111000101101… |
… | …01101011001111001 |
3 | 1001221110111012100021 |
4 | 22130112231121321 |
5 | 140431030232213 |
6 | 5052400210441 |
7 | 544605030055 |
oct | 123426553171 |
9 | 31843435307 |
10 | 11213133433 |
11 | 4834581127 |
12 | 220b309a21 |
13 | 109912c7c8 |
14 | 785310c65 |
15 | 45963ed8d |
hex | 29c5ad679 |
11213133433 has 2 divisors, whose sum is σ = 11213133434. Its totient is φ = 11213133432.
The previous prime is 11213133319. The next prime is 11213133439. The reversal of 11213133433 is 33433131211.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7650476089 + 3562657344 = 87467^2 + 59688^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11213133433 is a prime.
It is a super-2 number, since 2×112131334332 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11213133398 and 11213133407.
It is not a weakly prime, because it can be changed into another prime (11213133439) 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, 5606566716 + 5606566717.
It is an arithmetic number, because the mean of its divisors is an integer number (5606566717).
Almost surely, 211213133433 is an apocalyptic number.
It is an amenable number.
11213133433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11213133433 is an equidigital number, since it uses as much as digits as its factorization.
11213133433 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 1944, while the sum is 25.
Adding to 11213133433 its reverse (33433131211), we get a palindrome (44646264644).
The spelling of 11213133433 in words is "eleven billion, two hundred thirteen million, one hundred thirty-three thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.160 sec. • engine limits •