Base | Representation |
---|---|
bin | 1010011010011111… |
… | …10001010110001001 |
3 | 112102122100112201212 |
4 | 11031033301112021 |
5 | 42422240302314 |
6 | 2322441222505 |
7 | 255356160431 |
oct | 51517612611 |
9 | 15378315655 |
10 | 5590947209 |
11 | 2409a42431 |
12 | 1100491a35 |
13 | 6b1407ab3 |
14 | 3b076d2c1 |
15 | 22ac86e3e |
hex | 14d3f1589 |
5590947209 has 4 divisors (see below), whose sum is σ = 5591296260. Its totient is φ = 5590598160.
The previous prime is 5590947143. The next prime is 5590947211. The reversal of 5590947209 is 9027490955.
It is a happy number.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 2086662400 + 3504284809 = 45680^2 + 59197^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5590947209 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5590947259) 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, 149282 + ... + 182939.
It is an arithmetic number, because the mean of its divisors is an integer number (1397824065).
Almost surely, 25590947209 is an apocalyptic number.
It is an amenable number.
5590947209 is a deficient number, since it is larger than the sum of its proper divisors (349051).
5590947209 is a wasteful number, since it uses less digits than its factorization.
5590947209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 349050.
The product of its (nonzero) digits is 1020600, while the sum is 50.
The square root of 5590947209 is about 74772.6367664000. The cubic root of 5590947209 is about 1774.8505815109.
The spelling of 5590947209 in words is "five billion, five hundred ninety million, nine hundred forty-seven thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •