Base | Representation |
---|---|
bin | 100000111010100… |
… | …0111101110010111 |
3 | 2211222012120202212 |
4 | 1001311013232113 |
5 | 4230214204221 |
6 | 301332024035 |
7 | 36240423155 |
oct | 10165075627 |
9 | 2758176685 |
10 | 1104444311 |
11 | 5174803a3 |
12 | 269a6201b |
13 | 147a78859 |
14 | a69783d5 |
15 | 66e62b5b |
hex | 41d47b97 |
1104444311 has 2 divisors, whose sum is σ = 1104444312. Its totient is φ = 1104444310.
The previous prime is 1104444277. The next prime is 1104444359. The reversal of 1104444311 is 1134444011.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1104444311 - 26 = 1104444247 is a prime.
It is a super-2 number, since 2×11044443112 = 2439594472200529442, which contains 22 as substring.
It is a Sophie Germain prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1104444811) 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, 552222155 + 552222156.
It is an arithmetic number, because the mean of its divisors is an integer number (552222156).
Almost surely, 21104444311 is an apocalyptic number.
1104444311 is a deficient number, since it is larger than the sum of its proper divisors (1).
1104444311 is an equidigital number, since it uses as much as digits as its factorization.
1104444311 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 768, while the sum is 23.
The square root of 1104444311 is about 33233.1808739398. The cubic root of 1104444311 is about 1033.6684818409.
Adding to 1104444311 its reverse (1134444011), we get a palindrome (2238888322).
It can be divided in two parts, 11044 and 44311, that added together give a palindrome (55355).
The spelling of 1104444311 in words is "one billion, one hundred four million, four hundred forty-four thousand, three hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •