Base | Representation |
---|---|
bin | 100110111110001000011… |
… | …110111010001001001001 |
3 | 100111000112012212202010121 |
4 | 212332020132322021021 |
5 | 322334123413214012 |
6 | 5410140424343241 |
7 | 364324454025544 |
oct | 46761036721111 |
9 | 10430465782117 |
10 | 2678054429257 |
11 | 9428359aa359 |
12 | 373037014b21 |
13 | 16570222879c |
14 | 9389334185b |
15 | 499e0608a07 |
hex | 26f887ba249 |
2678054429257 has 2 divisors, whose sum is σ = 2678054429258. Its totient is φ = 2678054429256.
The previous prime is 2678054429207. The next prime is 2678054429263. The reversal of 2678054429257 is 7529244508762.
2678054429257 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., 2093985537721 + 584068891536 = 1447061^2 + 764244^2 .
It is a cyclic number.
It is not a de Polignac number, because 2678054429257 - 215 = 2678054396489 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2678054429195 and 2678054429204.
It is not a weakly prime, because it can be changed into another prime (2678054429207) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 1339027214628 + 1339027214629.
It is an arithmetic number, because the mean of its divisors is an integer number (1339027214629).
Almost surely, 22678054429257 is an apocalyptic number.
It is an amenable number.
2678054429257 is a deficient number, since it is larger than the sum of its proper divisors (1).
2678054429257 is an equidigital number, since it uses as much as digits as its factorization.
2678054429257 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 67737600, while the sum is 61.
The spelling of 2678054429257 in words is "two trillion, six hundred seventy-eight billion, fifty-four million, four hundred twenty-nine thousand, two hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •