Base | Representation |
---|---|
bin | 111100111011011… |
… | …0010000110100011 |
3 | 12021110220111020112 |
4 | 1321312302012203 |
5 | 13141331413011 |
6 | 534510401535 |
7 | 101443101620 |
oct | 17166620643 |
9 | 5243814215 |
10 | 2044404131 |
11 | 95a0160a0 |
12 | 4908002ab |
13 | 2677236b3 |
14 | 155737347 |
15 | be73458b |
hex | 79db21a3 |
2044404131 has 16 divisors (see below), whose sum is σ = 2549968128. Its totient is φ = 1592354400.
The previous prime is 2044404101. The next prime is 2044404133. The reversal of 2044404131 is 1314044402.
It is a happy number.
It is not a de Polignac number, because 2044404131 - 218 = 2044141987 is a prime.
It is a super-2 number, since 2×20444041312 = 8359176501699730322, which contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 2044404097 and 2044404106.
It is not an unprimeable number, because it can be changed into a prime (2044404133) 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 in 15 ways as a sum of consecutive naturals, for example, 243896 + ... + 252138.
It is an arithmetic number, because the mean of its divisors is an integer number (159373008).
Almost surely, 22044404131 is an apocalyptic number.
2044404131 is a deficient number, since it is larger than the sum of its proper divisors (505563997).
2044404131 is a wasteful number, since it uses less digits than its factorization.
2044404131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11482.
The product of its (nonzero) digits is 1536, while the sum is 23.
The square root of 2044404131 is about 45215.0874266544. The cubic root of 2044404131 is about 1269.1771657621.
Adding to 2044404131 its reverse (1314044402), we get a palindrome (3358448533).
The spelling of 2044404131 in words is "two billion, forty-four million, four hundred four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •