Base | Representation |
---|---|
bin | 1001011001010100… |
… | …11000011011110011 |
3 | 111000112200201100110 |
4 | 10230222120123303 |
5 | 40312313244211 |
6 | 2152312152403 |
7 | 236000425623 |
oct | 45452303363 |
9 | 14015621313 |
10 | 5044274931 |
11 | 21593a8463 |
12 | b89398703 |
13 | 625091187 |
14 | 35bd08883 |
15 | 1e7c9eea6 |
hex | 12ca986f3 |
5044274931 has 4 divisors (see below), whose sum is σ = 6725699912. Its totient is φ = 3362849952.
The previous prime is 5044274927. The next prime is 5044274981. The reversal of 5044274931 is 1394724405.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 5044274931 - 22 = 5044274927 is a prime.
It is a super-2 number, since 2×50442749312 = 50889419159030109522, which contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 5044274931.
It is not an unprimeable number, because it can be changed into a prime (5044274981) 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, 840712486 + ... + 840712491.
It is an arithmetic number, because the mean of its divisors is an integer number (1681424978).
Almost surely, 25044274931 is an apocalyptic number.
5044274931 is a deficient number, since it is larger than the sum of its proper divisors (1681424981).
5044274931 is a wasteful number, since it uses less digits than its factorization.
5044274931 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1681424980.
The product of its (nonzero) digits is 120960, while the sum is 39.
The square root of 5044274931 is about 71023.0591498282. The cubic root of 5044274931 is about 1715.0083928338.
The spelling of 5044274931 in words is "five billion, forty-four million, two hundred seventy-four thousand, nine hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •