Base | Representation |
---|---|
bin | 101101010011010001010… |
… | …101110011100010011001 |
3 | 102000121101002120000100112 |
4 | 231103101111303202121 |
5 | 402001031012222234 |
6 | 10342042433214105 |
7 | 440624511310262 |
oct | 55232125634231 |
9 | 12017332500315 |
10 | 3113068476569 |
11 | aa0276aa7737 |
12 | 423400401335 |
13 | 19773a9685cc |
14 | aa95d829969 |
15 | 55ea0e09ace |
hex | 2d4d1573899 |
3113068476569 has 2 divisors, whose sum is σ = 3113068476570. Its totient is φ = 3113068476568.
The previous prime is 3113068476559. The next prime is 3113068476619. The reversal of 3113068476569 is 9656748603113.
3113068476569 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2883584364544 + 229484112025 = 1698112^2 + 479045^2 .
It is a cyclic number.
It is not a de Polignac number, because 3113068476569 - 232 = 3108773509273 is a prime.
It is a super-2 number, since 2×31130684765692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (3113068476559) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1556534238284 + 1556534238285.
It is an arithmetic number, because the mean of its divisors is an integer number (1556534238285).
Almost surely, 23113068476569 is an apocalyptic number.
It is an amenable number.
3113068476569 is a deficient number, since it is larger than the sum of its proper divisors (1).
3113068476569 is an equidigital number, since it uses as much as digits as its factorization.
3113068476569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 19595520, while the sum is 59.
The spelling of 3113068476569 in words is "three trillion, one hundred thirteen billion, sixty-eight million, four hundred seventy-six thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •