Base | Representation |
---|---|
bin | 10011011111011100010101… |
… | …01011100011001110010001 |
3 | 12121202112210220112010012012 |
4 | 21233232022223203032101 |
5 | 21104221434130202212 |
6 | 231054235212112305 |
7 | 12012443330641304 |
oct | 1157561253431621 |
9 | 177675726463165 |
10 | 42861805319057 |
11 | 1272565377462a |
12 | 4982aa3a65695 |
13 | 1abbb0a5687ba |
14 | a82745842b3b |
15 | 4e4e01e98922 |
hex | 26fb8aae3391 |
42861805319057 has 2 divisors, whose sum is σ = 42861805319058. Its totient is φ = 42861805319056.
The previous prime is 42861805318963. The next prime is 42861805319089. The reversal of 42861805319057 is 75091350816824.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 41856125276161 + 1005680042896 = 6469631^2 + 1002836^2 .
It is a cyclic number.
It is not a de Polignac number, because 42861805319057 - 212 = 42861805314961 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 42861805318987 and 42861805319005.
It is not a weakly prime, because it can be changed into another prime (42861805369057) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21430902659528 + 21430902659529.
It is an arithmetic number, because the mean of its divisors is an integer number (21430902659529).
It is a 1-persistent number, because it is pandigital, but 2⋅42861805319057 = 85723610638114 is not.
Almost surely, 242861805319057 is an apocalyptic number.
It is an amenable number.
42861805319057 is a deficient number, since it is larger than the sum of its proper divisors (1).
42861805319057 is an equidigital number, since it uses as much as digits as its factorization.
42861805319057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 14515200, while the sum is 59.
The spelling of 42861805319057 in words is "forty-two trillion, eight hundred sixty-one billion, eight hundred five million, three hundred nineteen thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •