Base | Representation |
---|---|
bin | 111110010000011… |
… | …011001011100111 |
3 | 2200210101202002002 |
4 | 332100123023213 |
5 | 4114342234111 |
6 | 251351035515 |
7 | 34612021121 |
oct | 7620331347 |
9 | 2623352062 |
10 | 1044493031 |
11 | 49665308a |
12 | 25196bb9b |
13 | 138517b1a |
14 | 9ca10211 |
15 | 61a6e63b |
hex | 3e41b2e7 |
1044493031 has 4 divisors (see below), whose sum is σ = 1046073864. Its totient is φ = 1042912200.
The previous prime is 1044492991. The next prime is 1044493063. The reversal of 1044493031 is 1303944401.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 1044493031 - 214 = 1044476647 is a prime.
It is a super-2 number, since 2×10444930312 = 2181931383615133922, 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 = 1044492985 and 1044493003.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1044499031) 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 3 ways as a sum of consecutive naturals, for example, 789425 + ... + 790746.
It is an arithmetic number, because the mean of its divisors is an integer number (261518466).
Almost surely, 21044493031 is an apocalyptic number.
1044493031 is a deficient number, since it is larger than the sum of its proper divisors (1580833).
1044493031 is an equidigital number, since it uses as much as digits as its factorization.
1044493031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1580832.
The product of its (nonzero) digits is 5184, while the sum is 29.
The square root of 1044493031 is about 32318.6174054522. The cubic root of 1044493031 is about 1014.6163322995.
The spelling of 1044493031 in words is "one billion, forty-four million, four hundred ninety-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •