Base | Representation |
---|---|
bin | 10011011111111011011111… |
… | …10110100001100001111001 |
3 | 12121211010222211112000212222 |
4 | 21233331233312201201321 |
5 | 21110010214440030212 |
6 | 231110043241013425 |
7 | 12013605033364565 |
oct | 1157755766414171 |
9 | 177733884460788 |
10 | 42878535080057 |
11 | 12731759236696 |
12 | 4986192784275 |
13 | 1ac0575581371 |
14 | a834916986a5 |
15 | 4e5580a8ec72 |
hex | 26ff6fda1879 |
42878535080057 has 2 divisors, whose sum is σ = 42878535080058. Its totient is φ = 42878535080056.
The previous prime is 42878535079997. The next prime is 42878535080111. The reversal of 42878535080057 is 75008053587824.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 23463134703376 + 19415400376681 = 4843876^2 + 4406291^2 .
It is a cyclic number.
It is not a de Polignac number, because 42878535080057 - 238 = 42603657173113 is a prime.
It is a super-2 number, since 2×428785350800572 (a number of 28 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (42878535082057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21439267540028 + 21439267540029.
It is an arithmetic number, because the mean of its divisors is an integer number (21439267540029).
Almost surely, 242878535080057 is an apocalyptic number.
It is an amenable number.
42878535080057 is a deficient number, since it is larger than the sum of its proper divisors (1).
42878535080057 is an equidigital number, since it uses as much as digits as its factorization.
42878535080057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 75264000, while the sum is 62.
The spelling of 42878535080057 in words is "forty-two trillion, eight hundred seventy-eight billion, five hundred thirty-five million, eighty thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •