Base | Representation |
---|---|
bin | 100001111011101010101… |
… | …1110100000011111111001 |
3 | 121111211121202210111111012 |
4 | 1003313111132200133321 |
5 | 1102402043442414401 |
6 | 13530234332243305 |
7 | 660635606644616 |
oct | 103672536403771 |
9 | 17454552714435 |
10 | 4663621060601 |
11 | 1538915565698 |
12 | 633a11310535 |
13 | 27aa15458319 |
14 | 121a12d4950d |
15 | 814a13ec8bb |
hex | 43dd57a07f9 |
4663621060601 has 2 divisors, whose sum is σ = 4663621060602. Its totient is φ = 4663621060600.
The previous prime is 4663621060597. The next prime is 4663621060603. The reversal of 4663621060601 is 1060601263664.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 4032160384576 + 631460676025 = 2008024^2 + 794645^2 .
It is a cyclic number.
It is not a de Polignac number, because 4663621060601 - 22 = 4663621060597 is a prime.
It is a super-2 number, since 2×46636210606012 (a number of 26 digits) contains 22 as substring.
It is a Sophie Germain prime.
Together with 4663621060603, 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 (4663621060603) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2331810530300 + 2331810530301.
It is an arithmetic number, because the mean of its divisors is an integer number (2331810530301).
Almost surely, 24663621060601 is an apocalyptic number.
It is an amenable number.
4663621060601 is a deficient number, since it is larger than the sum of its proper divisors (1).
4663621060601 is an equidigital number, since it uses as much as digits as its factorization.
4663621060601 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 186624, while the sum is 41.
The spelling of 4663621060601 in words is "four trillion, six hundred sixty-three billion, six hundred twenty-one million, sixty thousand, six hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •