Base | Representation |
---|---|
bin | 10100100100100100… |
… | …10100111011010001 |
3 | 1001111200122010021221 |
4 | 22102102110323101 |
5 | 140104304244213 |
6 | 5023523445041 |
7 | 540454154032 |
oct | 122222247321 |
9 | 31450563257 |
10 | 11044212433 |
11 | 47581962a1 |
12 | 2182826781 |
13 | 1070137657 |
14 | 76aadca89 |
15 | 4498c438d |
hex | 292494ed1 |
11044212433 has 2 divisors, whose sum is σ = 11044212434. Its totient is φ = 11044212432.
The previous prime is 11044212379. The next prime is 11044212467. The reversal of 11044212433 is 33421244011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 10426043664 + 618168769 = 102108^2 + 24863^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11044212433 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11044212398 and 11044212407.
It is not a weakly prime, because it can be changed into another prime (11044216433) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5522106216 + 5522106217.
It is an arithmetic number, because the mean of its divisors is an integer number (5522106217).
Almost surely, 211044212433 is an apocalyptic number.
It is an amenable number.
11044212433 is a deficient number, since it is larger than the sum of its proper divisors (1).
11044212433 is an equidigital number, since it uses as much as digits as its factorization.
11044212433 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2304, while the sum is 25.
Adding to 11044212433 its reverse (33421244011), we get a palindrome (44465456444).
The spelling of 11044212433 in words is "eleven billion, forty-four million, two hundred twelve thousand, four hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •