Base | Representation |
---|---|
bin | 1001110110000101… |
… | …10101001000101001 |
3 | 111122100201112001112 |
4 | 10323002311020221 |
5 | 41311101034334 |
6 | 2232252000105 |
7 | 244660363256 |
oct | 47302651051 |
9 | 14570645045 |
10 | 5285564969 |
11 | 2272622213 |
12 | 1036160035 |
13 | 663074249 |
14 | 381d9842d |
15 | 20e0634ce |
hex | 13b0b5229 |
5285564969 has 4 divisors (see below), whose sum is σ = 5467825860. Its totient is φ = 5103304080.
The previous prime is 5285564923. The next prime is 5285565011. The reversal of 5285564969 is 9694655825.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 1431638569 + 3853926400 = 37837^2 + 62080^2 .
It is a cyclic number.
It is not a de Polignac number, because 5285564969 - 212 = 5285560873 is a prime.
It is a super-2 number, since 2×52855649692 = 55874394083039941922, which contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (5285564909) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 91130402 + ... + 91130459.
It is an arithmetic number, because the mean of its divisors is an integer number (1366956465).
Almost surely, 25285564969 is an apocalyptic number.
It is an amenable number.
5285564969 is a deficient number, since it is larger than the sum of its proper divisors (182260891).
5285564969 is a wasteful number, since it uses less digits than its factorization.
5285564969 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 182260890.
The product of its digits is 23328000, while the sum is 59.
The square root of 5285564969 is about 72701.8910964495. The cubic root of 5285564969 is about 1741.9290897278.
The spelling of 5285564969 in words is "five billion, two hundred eighty-five million, five hundred sixty-four thousand, nine hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •