Base | Representation |
---|---|
bin | 111111001011111100000… |
… | …010010110101011010001 |
3 | 120101002211120201010211102 |
4 | 333023330002112223101 |
5 | 1032120203213211221 |
6 | 13122430514154145 |
7 | 625465261205621 |
oct | 77137402265321 |
9 | 16332746633742 |
10 | 4342145444561 |
11 | 14245479a4191 |
12 | 5a1653882955 |
13 | 256602319502 |
14 | 110237968881 |
15 | 77e3869330b |
hex | 3f2fc096ad1 |
4342145444561 has 2 divisors, whose sum is σ = 4342145444562. Its totient is φ = 4342145444560.
The previous prime is 4342145444557. The next prime is 4342145444563. The reversal of 4342145444561 is 1654445412434.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4230693628225 + 111451816336 = 2056865^2 + 333844^2 .
It is a cyclic number.
It is not a de Polignac number, because 4342145444561 - 22 = 4342145444557 is a prime.
It is a Sophie Germain prime.
Together with 4342145444563, it forms a pair of twin primes.
It is a Chen prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (4342145444563) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2171072722280 + 2171072722281.
It is an arithmetic number, because the mean of its divisors is an integer number (2171072722281).
Almost surely, 24342145444561 is an apocalyptic number.
It is an amenable number.
4342145444561 is a deficient number, since it is larger than the sum of its proper divisors (1).
4342145444561 is an equidigital number, since it uses as much as digits as its factorization.
4342145444561 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 3686400, while the sum is 47.
The spelling of 4342145444561 in words is "four trillion, three hundred forty-two billion, one hundred forty-five million, four hundred forty-four thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •