Base | Representation |
---|---|
bin | 100000010100100001010… |
… | …0101011101011001011101 |
3 | 120201122212111212101010002 |
4 | 1000221002211131121131 |
5 | 1040234422001100221 |
6 | 13240402332224045 |
7 | 635634465024443 |
oct | 100510245353135 |
9 | 16648774771102 |
10 | 4442113300061 |
11 | 1462987174688 |
12 | 5b8ab290b025 |
13 | 262b74282b28 |
14 | 114ddc61cb93 |
15 | 7a839b7d80b |
hex | 40a4295d65d |
4442113300061 has 2 divisors, whose sum is σ = 4442113300062. Its totient is φ = 4442113300060.
The previous prime is 4442113300007. The next prime is 4442113300067. The reversal of 4442113300061 is 1600033112444.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3601572723961 + 840540576100 = 1897781^2 + 916810^2 .
It is a cyclic number.
It is not a de Polignac number, because 4442113300061 - 26 = 4442113299997 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4442113299997 and 4442113300033.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4442113300067) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2221056650030 + 2221056650031.
It is an arithmetic number, because the mean of its divisors is an integer number (2221056650031).
Almost surely, 24442113300061 is an apocalyptic number.
It is an amenable number.
4442113300061 is a deficient number, since it is larger than the sum of its proper divisors (1).
4442113300061 is an equidigital number, since it uses as much as digits as its factorization.
4442113300061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 29.
The spelling of 4442113300061 in words is "four trillion, four hundred forty-two billion, one hundred thirteen million, three hundred thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •