Base | Representation |
---|---|
bin | 101001010111010100010… |
… | …0001001100001000001001 |
3 | 202010111011020022101222012 |
4 | 1102232220201030020021 |
5 | 1221121010131132241 |
6 | 20031403514505305 |
7 | 1124506211141006 |
oct | 122565041141011 |
9 | 22114136271865 |
10 | 5685069005321 |
11 | 18a202a275932 |
12 | 77997a135235 |
13 | 32313b095cc4 |
14 | 159231aaa8ad |
15 | 9cd35a956eb |
hex | 52ba884c209 |
5685069005321 has 2 divisors, whose sum is σ = 5685069005322. Its totient is φ = 5685069005320.
The previous prime is 5685069005251. The next prime is 5685069005351. The reversal of 5685069005321 is 1235009605865.
5685069005321 is digitally balanced in base 3, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 5412188140921 + 272880864400 = 2326411^2 + 522380^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-5685069005321 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 5685069005321.
It is not a weakly prime, because it can be changed into another prime (5685069005351) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2842534502660 + 2842534502661.
It is an arithmetic number, because the mean of its divisors is an integer number (2842534502661).
Almost surely, 25685069005321 is an apocalyptic number.
It is an amenable number.
5685069005321 is a deficient number, since it is larger than the sum of its proper divisors (1).
5685069005321 is an equidigital number, since it uses as much as digits as its factorization.
5685069005321 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 1944000, while the sum is 50.
The spelling of 5685069005321 in words is "five trillion, six hundred eighty-five billion, sixty-nine million, five thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •