Base | Representation |
---|---|
bin | 10011010000101011010101… |
… | …11011010101011111001101 |
3 | 12112222001021120220222201002 |
4 | 21220111222323111133031 |
5 | 21022413421402222021 |
6 | 230025212343230045 |
7 | 11631003106445255 |
oct | 1150255273253715 |
9 | 175861246828632 |
10 | 42354466445261 |
11 | 1254a479147683 |
12 | 49006b5148325 |
13 | 1a83016b55c69 |
14 | a65d77a90965 |
15 | 4d6b0be0e50b |
hex | 26856aed57cd |
42354466445261 has 2 divisors, whose sum is σ = 42354466445262. Its totient is φ = 42354466445260.
The previous prime is 42354466445243. The next prime is 42354466445363. The reversal of 42354466445261 is 16254466445324.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 38386326748900 + 3968139696361 = 6195670^2 + 1992019^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-42354466445261 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 42354466445197 and 42354466445206.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (42354466445201) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21177233222630 + 21177233222631.
It is an arithmetic number, because the mean of its divisors is an integer number (21177233222631).
Almost surely, 242354466445261 is an apocalyptic number.
It is an amenable number.
42354466445261 is a deficient number, since it is larger than the sum of its proper divisors (1).
42354466445261 is an equidigital number, since it uses as much as digits as its factorization.
42354466445261 is an evil number, because the sum of its binary digits is even.
The product of its digits is 66355200, while the sum is 56.
The spelling of 42354466445261 in words is "forty-two trillion, three hundred fifty-four billion, four hundred sixty-six million, four hundred forty-five thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •