Base | Representation |
---|---|
bin | 1001010111110100… |
… | …10100000100111001 |
3 | 110222122222112100120 |
4 | 10223322110010321 |
5 | 40301102033134 |
6 | 2151142123453 |
7 | 235455344664 |
oct | 45372240471 |
9 | 13878875316 |
10 | 5031674169 |
11 | 2152281305 |
12 | b85120589 |
13 | 62259b8c2 |
14 | 35a3886db |
15 | 1e6b11649 |
hex | 12be94139 |
5031674169 has 4 divisors (see below), whose sum is σ = 6708898896. Its totient is φ = 3354449444.
The previous prime is 5031674149. The next prime is 5031674171. The reversal of 5031674169 is 9614761305.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 5031674169 - 27 = 5031674041 is a prime.
It is a super-2 number, since 2×50316741692 = 50635489885963681122, 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 5031674169.
It is not an unprimeable number, because it can be changed into a prime (5031674149) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 838612359 + ... + 838612364.
It is an arithmetic number, because the mean of its divisors is an integer number (1677224724).
Almost surely, 25031674169 is an apocalyptic number.
It is an amenable number.
5031674169 is a deficient number, since it is larger than the sum of its proper divisors (1677224727).
5031674169 is a wasteful number, since it uses less digits than its factorization.
5031674169 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1677224726.
The product of its (nonzero) digits is 136080, while the sum is 42.
The square root of 5031674169 is about 70934.2947311101. The cubic root of 5031674169 is about 1713.5791532569.
The spelling of 5031674169 in words is "five billion, thirty-one million, six hundred seventy-four thousand, one hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •