Base | Representation |
---|---|
bin | 1010100010111001… |
… | …11100010110010101 |
3 | 112121120010110100000 |
4 | 11101130330112111 |
5 | 43043321242023 |
6 | 2333441441513 |
7 | 260204014116 |
oct | 52134742625 |
9 | 15546113300 |
10 | 5661509013 |
11 | 2445857576 |
12 | 1120040299 |
13 | 6c2c12244 |
14 | 3b9c9a20d |
15 | 232074243 |
hex | 15173c595 |
5661509013 has 48 divisors (see below), whose sum is σ = 8774438400. Its totient is φ = 3644144640.
The previous prime is 5661508991. The next prime is 5661509017. The reversal of 5661509013 is 3109051665.
5661509013 is a `hidden beast` number, since 566 + 1 + 5 + 0 + 90 + 1 + 3 = 666.
It is not a de Polignac number, because 5661509013 - 28 = 5661508757 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5661509017) 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 47 ways as a sum of consecutive naturals, for example, 6093733 + ... + 6094661.
It is an arithmetic number, because the mean of its divisors is an integer number (182800800).
Almost surely, 25661509013 is an apocalyptic number.
It is an amenable number.
5661509013 is a deficient number, since it is larger than the sum of its proper divisors (3112929387).
5661509013 is an equidigital number, since it uses as much as digits as its factorization.
5661509013 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1784 (or 1772 counting only the distinct ones).
The product of its (nonzero) digits is 24300, while the sum is 36.
The square root of 5661509013 is about 75242.9997607751. Note that the first 3 decimals coincide. The cubic root of 5661509013 is about 1782.2860218375.
Adding to 5661509013 its sum of digits (36), we get a square (5661509049 = 752432).
The spelling of 5661509013 in words is "five billion, six hundred sixty-one million, five hundred nine thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •