Base | Representation |
---|---|
bin | 111101011011101011000… |
… | …010101101011100000101 |
3 | 112221120200122112010011111 |
4 | 331123223002231130011 |
5 | 1023131314404201322 |
6 | 12551213221405021 |
7 | 614000133322501 |
oct | 75335302553405 |
9 | 15846618463144 |
10 | 4221601240837 |
11 | 1388409930822 |
12 | 582211869771 |
13 | 248131471006 |
14 | 108480241301 |
15 | 74c30a42177 |
hex | 3d6eb0ad705 |
4221601240837 has 2 divisors, whose sum is σ = 4221601240838. Its totient is φ = 4221601240836.
The previous prime is 4221601240819. The next prime is 4221601240841. The reversal of 4221601240837 is 7380421061224.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2482014344481 + 1739586896356 = 1575441^2 + 1318934^2 .
It is a cyclic number.
It is not a de Polignac number, because 4221601240837 - 223 = 4221592852229 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 4221601240837.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4221601240807) 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, 2110800620418 + 2110800620419.
It is an arithmetic number, because the mean of its divisors is an integer number (2110800620419).
Almost surely, 24221601240837 is an apocalyptic number.
It is an amenable number.
4221601240837 is a deficient number, since it is larger than the sum of its proper divisors (1).
4221601240837 is an equidigital number, since it uses as much as digits as its factorization.
4221601240837 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 129024, while the sum is 40.
The spelling of 4221601240837 in words is "four trillion, two hundred twenty-one billion, six hundred one million, two hundred forty thousand, eight hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •