Base | Representation |
---|---|
bin | 10100111100011010… |
… | …10111111000110001 |
3 | 1002000122000121010101 |
4 | 22132031113320301 |
5 | 141012011143213 |
6 | 5055431032401 |
7 | 545433316036 |
oct | 123615277061 |
9 | 32018017111 |
10 | 11244240433 |
11 | 4850098298 |
12 | 221980b701 |
13 | 10a270160a |
14 | 7894cb38d |
15 | 45c236bdd |
hex | 29e357e31 |
11244240433 has 2 divisors, whose sum is σ = 11244240434. Its totient is φ = 11244240432.
The previous prime is 11244240431. The next prime is 11244240457. The reversal of 11244240433 is 33404244211.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 8488305424 + 2755935009 = 92132^2 + 52497^2 .
It is a cyclic number.
It is not a de Polignac number, because 11244240433 - 21 = 11244240431 is a prime.
It is a super-2 number, since 2×112442404332 (a number of 21 digits) contains 22 as substring.
Together with 11244240431, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (11244240431) 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, 5622120216 + 5622120217.
It is an arithmetic number, because the mean of its divisors is an integer number (5622120217).
Almost surely, 211244240433 is an apocalyptic number.
It is an amenable number.
11244240433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11244240433 is an equidigital number, since it uses as much as digits as its factorization.
11244240433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 9216, while the sum is 28.
Adding to 11244240433 its reverse (33404244211), we get a palindrome (44648484644).
The spelling of 11244240433 in words is "eleven billion, two hundred forty-four million, two hundred forty thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •