Base | Representation |
---|---|
bin | 111100111011000… |
… | …1111100000011111 |
3 | 12021110122021212101 |
4 | 1321312033200133 |
5 | 13141312344211 |
6 | 534503345531 |
7 | 101441641531 |
oct | 17166174037 |
9 | 5243567771 |
10 | 2044262431 |
11 | 959a29692 |
12 | 4907522a7 |
13 | 2676a4053 |
14 | 1556db851 |
15 | be7075c1 |
hex | 79d8f81f |
2044262431 has 2 divisors, whose sum is σ = 2044262432. Its totient is φ = 2044262430.
The previous prime is 2044262411. The next prime is 2044262447. The reversal of 2044262431 is 1342624402.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 2044262431 - 25 = 2044262399 is a prime.
It is a super-2 number, since 2×20442624312 = 8358017773596059522, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 2044262431.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2044262411) 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, 1022131215 + 1022131216.
It is an arithmetic number, because the mean of its divisors is an integer number (1022131216).
Almost surely, 22044262431 is an apocalyptic number.
2044262431 is a deficient number, since it is larger than the sum of its proper divisors (1).
2044262431 is an equidigital number, since it uses as much as digits as its factorization.
2044262431 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.
The square root of 2044262431 is about 45213.5204446635. The cubic root of 2044262431 is about 1269.1478423753.
Adding to 2044262431 its reverse (1342624402), we get a palindrome (3386886833).
The spelling of 2044262431 in words is "two billion, forty-four million, two hundred sixty-two thousand, four hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •