Base | Representation |
---|---|
bin | 100101011000011000000… |
… | …010110101111011111001 |
3 | 100002120111122210210112111 |
4 | 211120120002311323321 |
5 | 314041342210411101 |
6 | 5244030531012321 |
7 | 353406051245614 |
oct | 45303002657371 |
9 | 10076448723474 |
10 | 2568793841401 |
11 | 900468178567 |
12 | 355a23a3a0a1 |
13 | 15830bc8a078 |
14 | 8c48a43517b |
15 | 46c483bb251 |
hex | 256180b5ef9 |
2568793841401 has 2 divisors, whose sum is σ = 2568793841402. Its totient is φ = 2568793841400.
The previous prime is 2568793841371. The next prime is 2568793841461. The reversal of 2568793841401 is 1041483978652.
2568793841401 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., 2089238976400 + 479554865001 = 1445420^2 + 692499^2 .
It is a cyclic number.
It is not a de Polignac number, because 2568793841401 - 233 = 2560203906809 is a prime.
It is not a weakly prime, because it can be changed into another prime (2568793841461) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1284396920700 + 1284396920701.
It is an arithmetic number, because the mean of its divisors is an integer number (1284396920701).
It is a 1-persistent number, because it is pandigital, but 2⋅2568793841401 = 5137587682802 is not.
Almost surely, 22568793841401 is an apocalyptic number.
It is an amenable number.
2568793841401 is a deficient number, since it is larger than the sum of its proper divisors (1).
2568793841401 is an equidigital number, since it uses as much as digits as its factorization.
2568793841401 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 11612160, while the sum is 58.
The spelling of 2568793841401 in words is "two trillion, five hundred sixty-eight billion, seven hundred ninety-three million, eight hundred forty-one thousand, four hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •