Base | Representation |
---|---|
bin | 1010000011000010… |
… | …00101010000110111 |
3 | 111220221001122120121 |
4 | 11001201011100313 |
5 | 42021401034042 |
6 | 2251131312411 |
7 | 250446410023 |
oct | 50141052067 |
9 | 14827048517 |
10 | 5394158647 |
11 | 2318953259 |
12 | 10665ab707 |
13 | 67c706467 |
14 | 392585383 |
15 | 218864367 |
hex | 141845437 |
5394158647 has 4 divisors (see below), whose sum is σ = 5398088760. Its totient is φ = 5390228536.
The previous prime is 5394158591. The next prime is 5394158711. The reversal of 5394158647 is 7468514935.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5394158647 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5394158594 and 5394158603.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5394155647) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1962997 + ... + 1965742.
It is an arithmetic number, because the mean of its divisors is an integer number (1349522190).
Almost surely, 25394158647 is an apocalyptic number.
5394158647 is a deficient number, since it is larger than the sum of its proper divisors (3930113).
5394158647 is a wasteful number, since it uses less digits than its factorization.
5394158647 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3930112.
The product of its digits is 3628800, while the sum is 52.
The square root of 5394158647 is about 73444.9361562797. The cubic root of 5394158647 is about 1753.7778139562. Note that the first 3 decimals are identical.
The spelling of 5394158647 in words is "five billion, three hundred ninety-four million, one hundred fifty-eight thousand, six hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •