Base | Representation |
---|---|
bin | 1010001110011010… |
… | …10100100010101101 |
3 | 112011120201200121221 |
4 | 11013031110202231 |
5 | 42220322013040 |
6 | 2304422023341 |
7 | 253016120065 |
oct | 50715244255 |
9 | 15146650557 |
10 | 5489641645 |
11 | 236783a024 |
12 | 1092577b51 |
13 | 696427c87 |
14 | 3a111c3a5 |
15 | 221e2574a |
hex | 1473548ad |
5489641645 has 8 divisors (see below), whose sum is σ = 6590102904. Its totient is φ = 4390024704.
The previous prime is 5489641637. The next prime is 5489641657. The reversal of 5489641645 is 5461469845.
It can be written as a sum of positive squares in 4 ways, for example, as 450203524 + 5039438121 = 21218^2 + 70989^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 5489641645 - 23 = 5489641637 is a prime.
It is a super-3 number, since 3×54896416453 (a number of 30 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 5489641592 and 5489641601.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 196684 + ... + 222853.
It is an arithmetic number, because the mean of its divisors is an integer number (823762863).
Almost surely, 25489641645 is an apocalyptic number.
It is an amenable number.
5489641645 is a deficient number, since it is larger than the sum of its proper divisors (1100461259).
5489641645 is a wasteful number, since it uses less digits than its factorization.
5489641645 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 422159.
The product of its digits is 4147200, while the sum is 52.
The square root of 5489641645 is about 74092.1159436009. The cubic root of 5489641645 is about 1764.0653318332.
The spelling of 5489641645 in words is "five billion, four hundred eighty-nine million, six hundred forty-one thousand, six hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •