Base | Representation |
---|---|
bin | 1001011001011001… |
… | …11000101111000111 |
3 | 111000120221002000211 |
4 | 10230230320233013 |
5 | 40313000302102 |
6 | 2152334220251 |
7 | 236006132116 |
oct | 45454705707 |
9 | 14016832024 |
10 | 5044931527 |
11 | 21598067a9 |
12 | b89654687 |
13 | 625260cac |
14 | 35c039c7d |
15 | 1e7d7e7d7 |
hex | 12cb38bc7 |
5044931527 has 8 divisors (see below), whose sum is σ = 5386702464. Its totient is φ = 4713362808.
The previous prime is 5044931519. The next prime is 5044931569. The reversal of 5044931527 is 7251394405.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 5044931527 - 23 = 5044931519 is a prime.
It is a super-2 number, since 2×50449315272 = 50902668224237103458, 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 5044931527.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5044931587) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2549533 + ... + 2551510.
It is an arithmetic number, because the mean of its divisors is an integer number (673337808).
Almost surely, 25044931527 is an apocalyptic number.
5044931527 is a deficient number, since it is larger than the sum of its proper divisors (341770937).
5044931527 is a wasteful number, since it uses less digits than its factorization.
5044931527 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5101109.
The product of its (nonzero) digits is 151200, while the sum is 40.
The square root of 5044931527 is about 71027.6814136573. The cubic root of 5044931527 is about 1715.0828018626.
The spelling of 5044931527 in words is "five billion, forty-four million, nine hundred thirty-one thousand, five hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •