Base | Representation |
---|---|
bin | 1001110101011000… |
… | …11010101111100001 |
3 | 111121221200000200212 |
4 | 10322230122233201 |
5 | 41303100032242 |
6 | 2231522023505 |
7 | 244556423222 |
oct | 47254325741 |
9 | 14557600625 |
10 | 5279689697 |
11 | 226a27a017 |
12 | 10341a7b95 |
13 | 661a97c59 |
14 | 3812a9249 |
15 | 20d7a2782 |
hex | 13ab1abe1 |
5279689697 has 4 divisors (see below), whose sum is σ = 5318227716. Its totient is φ = 5241151680.
The previous prime is 5279689693. The next prime is 5279689757. The reversal of 5279689697 is 7969869725.
5279689697 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
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 2775287761 + 2504401936 = 52681^2 + 50044^2 .
It is a cyclic number.
It is not a de Polignac number, because 5279689697 - 22 = 5279689693 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (5279689693) 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, 19268804 + ... + 19269077.
It is an arithmetic number, because the mean of its divisors is an integer number (1329556929).
Almost surely, 25279689697 is an apocalyptic number.
It is an amenable number.
5279689697 is a deficient number, since it is larger than the sum of its proper divisors (38538019).
5279689697 is a wasteful number, since it uses less digits than its factorization.
5279689697 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 38538018.
The product of its digits is 102876480, while the sum is 68.
The square root of 5279689697 is about 72661.4732647226. The cubic root of 5279689697 is about 1741.2834254417.
The spelling of 5279689697 in words is "five billion, two hundred seventy-nine million, six hundred eighty-nine thousand, six hundred ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •