Base | Representation |
---|---|
bin | 1010100110010100… |
… | …01001101110010001 |
3 | 112200112222221012221 |
4 | 11103022021232101 |
5 | 43123133344424 |
6 | 2340343221041 |
7 | 261002241061 |
oct | 52312115621 |
9 | 15615887187 |
10 | 5690137489 |
11 | 245aa30573 |
12 | 1129747781 |
13 | 6c8b26b7a |
14 | 3bd9cd3a1 |
15 | 23482b9e4 |
hex | 153289b91 |
5690137489 has 9 divisors (see below), whose sum is σ = 5732159409. Its totient is φ = 5648423040.
The previous prime is 5690137483. The next prime is 5690137493. The reversal of 5690137489 is 9847310965.
It is a happy number.
The square root of 5690137489 is 75433.
It is a perfect power (a square), and thus also a powerful number.
It can be written as a sum of positive squares in 4 ways, for example, as 1037806225 + 4652331264 = 32215^2 + 68208^2 .
It is not a de Polignac number, because 5690137489 - 211 = 5690135441 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5690137483) by changing a digit.
It is a polite number, since it can be written in 8 ways as a sum of consecutive naturals, for example, 18179197 + ... + 18179509.
It is an arithmetic number, because the mean of its divisors is an integer number (636906601).
Almost surely, 25690137489 is an apocalyptic number.
5690137489 is the 75433-rd square number.
5690137489 is the 37717-th centered octagonal number.
It is an amenable number.
5690137489 is a deficient number, since it is larger than the sum of its proper divisors (42021920).
5690137489 is an frugal number, since it uses more digits than its factorization.
5690137489 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1108 (or 554 counting only the distinct ones).
The product of its (nonzero) digits is 1632960, while the sum is 52.
The cubic root of 5690137489 is about 1785.2851261950.
The spelling of 5690137489 in words is "five billion, six hundred ninety million, one hundred thirty-seven thousand, four hundred eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •