Base | Representation |
---|---|
bin | 1010100110001110… |
… | …00000110000100101 |
3 | 112200111110010001222 |
4 | 11103013000300211 |
5 | 43122431024331 |
6 | 2340313430125 |
7 | 260662242164 |
oct | 52307006045 |
9 | 15614403058 |
10 | 5689314341 |
11 | 245a519087 |
12 | 112940b345 |
13 | 6c88c92b9 |
14 | 3bd8573db |
15 | 234717b7b |
hex | 1531c0c25 |
5689314341 has 16 divisors (see below), whose sum is σ = 5791564800. Its totient is φ = 5588310000.
The previous prime is 5689314331. The next prime is 5689314353. The reversal of 5689314341 is 1434139865.
It is a cyclic number.
It is not a de Polignac number, because 5689314341 - 222 = 5685120037 is a prime.
It is a super-3 number, since 3×56893143413 (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 = 5689314292 and 5689314301.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5689314311) 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 15 ways as a sum of consecutive naturals, for example, 6244676 + ... + 6245586.
It is an arithmetic number, because the mean of its divisors is an integer number (361972800).
Almost surely, 25689314341 is an apocalyptic number.
It is an amenable number.
5689314341 is a deficient number, since it is larger than the sum of its proper divisors (102250459).
5689314341 is a wasteful number, since it uses less digits than its factorization.
5689314341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1480.
The product of its digits is 311040, while the sum is 44.
The square root of 5689314341 is about 75427.5436495184. The cubic root of 5689314341 is about 1785.1990342653.
The spelling of 5689314341 in words is "five billion, six hundred eighty-nine million, three hundred fourteen thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •