Base | Representation |
---|---|
bin | 100001101010101111111… |
… | …000011010001111000001 |
3 | 22012011220202212112100011 |
4 | 201222233320122033001 |
5 | 300401320130034234 |
6 | 4530512323224521 |
7 | 326104143523063 |
oct | 41525770321701 |
9 | 8164822775304 |
10 | 2313643205569 |
11 | 812235300393 |
12 | 314496518141 |
13 | 13a238aaa187 |
14 | 7dda394d733 |
15 | 402b32e2b64 |
hex | 21aafe1a3c1 |
2313643205569 has 2 divisors, whose sum is σ = 2313643205570. Its totient is φ = 2313643205568.
The previous prime is 2313643205501. The next prime is 2313643205603. The reversal of 2313643205569 is 9655023463132.
2313643205569 is digitally balanced in base 2, 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., 1561720097344 + 751923108225 = 1249688^2 + 867135^2 .
It is a cyclic number.
It is not a de Polignac number, because 2313643205569 - 213 = 2313643197377 is a prime.
It is a super-2 number, since 2×23136432055692 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2313643202569) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1156821602784 + 1156821602785.
It is an arithmetic number, because the mean of its divisors is an integer number (1156821602785).
Almost surely, 22313643205569 is an apocalyptic number.
It is an amenable number.
2313643205569 is a deficient number, since it is larger than the sum of its proper divisors (1).
2313643205569 is an equidigital number, since it uses as much as digits as its factorization.
2313643205569 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3499200, while the sum is 49.
The spelling of 2313643205569 in words is "two trillion, three hundred thirteen billion, six hundred forty-three million, two hundred five thousand, five hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •