Base | Representation |
---|---|
bin | 100100111101011100111… |
… | …000011011101100000001 |
3 | 22222210212212210010111001 |
4 | 210331130320123230001 |
5 | 313103140244004111 |
6 | 5222450120052001 |
7 | 351333456345301 |
oct | 44753470335401 |
9 | 8883785703431 |
10 | 2539883969281 |
11 | 89a18231676a |
12 | 3502b6004001 |
13 | 1556826ca369 |
14 | 8ad06ab9601 |
15 | 461053281c1 |
hex | 24f5ce1bb01 |
2539883969281 has 2 divisors, whose sum is σ = 2539883969282. Its totient is φ = 2539883969280.
The previous prime is 2539883969269. The next prime is 2539883969297. The reversal of 2539883969281 is 1829693889352.
2539883969281 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., 2419141618881 + 120742350400 = 1555359^2 + 347480^2 .
It is a cyclic number.
It is not a de Polignac number, because 2539883969281 - 213 = 2539883961089 is a prime.
It is a super-2 number, since 2×25398839692812 (a number of 26 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (2539883969201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1269941984640 + 1269941984641.
It is an arithmetic number, because the mean of its divisors is an integer number (1269941984641).
Almost surely, 22539883969281 is an apocalyptic number.
It is an amenable number.
2539883969281 is a deficient number, since it is larger than the sum of its proper divisors (1).
2539883969281 is an equidigital number, since it uses as much as digits as its factorization.
2539883969281 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 403107840, while the sum is 73.
The spelling of 2539883969281 in words is "two trillion, five hundred thirty-nine billion, eight hundred eighty-three million, nine hundred sixty-nine thousand, two hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.097 sec. • engine limits •