Base | Representation |
---|---|
bin | 10100100100100100… |
… | …10101011010011111 |
3 | 1001111200122020000221 |
4 | 22102102111122133 |
5 | 140104304330211 |
6 | 5023523502211 |
7 | 540454162615 |
oct | 122222253237 |
9 | 31450566027 |
10 | 11044214431 |
11 | 4758197848 |
12 | 2182827967 |
13 | 1070138533 |
14 | 76aadd6b5 |
15 | 4498c4c71 |
hex | 29249569f |
11044214431 has 2 divisors, whose sum is σ = 11044214432. Its totient is φ = 11044214430.
The previous prime is 11044214393. The next prime is 11044214459. The reversal of 11044214431 is 13441244011.
11044214431 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 11044214431 - 29 = 11044213919 is a prime.
It is a super-2 number, since 2×110442144312 (a number of 21 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 11044214396 and 11044214405.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11044214131) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5522107215 + 5522107216.
It is an arithmetic number, because the mean of its divisors is an integer number (5522107216).
Almost surely, 211044214431 is an apocalyptic number.
11044214431 is a deficient number, since it is larger than the sum of its proper divisors (1).
11044214431 is an equidigital number, since it uses as much as digits as its factorization.
11044214431 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 11044214431 its reverse (13441244011), we get a palindrome (24485458442).
The spelling of 11044214431 in words is "eleven billion, forty-four million, two hundred fourteen thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •