Base | Representation |
---|---|
bin | 1010011010010111… |
… | …11010101111001001 |
3 | 112102120110020010022 |
4 | 11031023322233021 |
5 | 42422010441342 |
6 | 2322403430225 |
7 | 255344452463 |
oct | 51513725711 |
9 | 15376406108 |
10 | 5589937097 |
11 | 2409412528 |
12 | 1100085375 |
13 | 6b11430b4 |
14 | 3b0589133 |
15 | 22ab379d2 |
hex | 14d2fabc9 |
5589937097 has 8 divisors (see below), whose sum is σ = 5753487432. Its totient is φ = 5427043200.
The previous prime is 5589937069. The next prime is 5589937109. The reversal of 5589937097 is 7907399855.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 167676601 + 5422260496 = 12949^2 + 73636^2 .
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 5589937097 - 26 = 5589937033 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5589937027) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 146804 + ... + 180917.
It is an arithmetic number, because the mean of its divisors is an integer number (719185929).
Almost surely, 25589937097 is an apocalyptic number.
It is an amenable number.
5589937097 is a deficient number, since it is larger than the sum of its proper divisors (163550335).
5589937097 is a wasteful number, since it uses less digits than its factorization.
5589937097 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 328219.
The product of its (nonzero) digits is 21432600, while the sum is 62.
The square root of 5589937097 is about 74765.8819047833. The cubic root of 5589937097 is about 1774.7436881240.
The spelling of 5589937097 in words is "five billion, five hundred eighty-nine million, nine hundred thirty-seven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •