Base | Representation |
---|---|
bin | 101001010111010100010… |
… | …0001001100000111011111 |
3 | 202010111011020022101220122 |
4 | 1102232220201030013133 |
5 | 1221121010131132104 |
6 | 20031403514505155 |
7 | 1124506211140616 |
oct | 122565041140737 |
9 | 22114136271818 |
10 | 5685069005279 |
11 | 18a202a2758a4 |
12 | 77997a1351bb |
13 | 32313b095c91 |
14 | 159231aaa87d |
15 | 9cd35a956be |
hex | 52ba884c1df |
5685069005279 has 32 divisors (see below), whose sum is σ = 6223926988800. Its totient is φ = 5176043832960.
The previous prime is 5685069005251. The next prime is 5685069005321. The reversal of 5685069005279 is 9725009605865.
5685069005279 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5685069005279 is a prime.
It is a Smith number, since the sum of its digits (62) coincides with the sum of the digits of its prime factors. Since it is squarefree, it is also a hoax number.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (5685069005479) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 34748462 + ... + 34911684.
It is an arithmetic number, because the mean of its divisors is an integer number (194497718400).
Almost surely, 25685069005279 is an apocalyptic number.
5685069005279 is a deficient number, since it is larger than the sum of its proper divisors (538857983521).
5685069005279 is a wasteful number, since it uses less digits than its factorization.
5685069005279 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164015.
The product of its (nonzero) digits is 40824000, while the sum is 62.
The spelling of 5685069005279 in words is "five trillion, six hundred eighty-five billion, sixty-nine million, five thousand, two hundred seventy-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •