Base | Representation |
---|---|
bin | 100000001001000010101… |
… | …1100111001001000011101 |
3 | 120122022020202100110110002 |
4 | 1000102011130321020131 |
5 | 1034333432110332221 |
6 | 13221204444424045 |
7 | 634102623500216 |
oct | 100220534711035 |
9 | 16568222313402 |
10 | 4417465324061 |
11 | 1453489015489 |
12 | 5b4174248025 |
13 | 260746960b4a |
14 | 113b40d0c40d |
15 | 79d95d4480b |
hex | 4048573921d |
4417465324061 has 2 divisors, whose sum is σ = 4417465324062. Its totient is φ = 4417465324060.
The previous prime is 4417465324001. The next prime is 4417465324091. The reversal of 4417465324061 is 1604235647144.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3590285988025 + 827179336036 = 1894805^2 + 909494^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4417465324061 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 4417465323997 and 4417465324015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4417465324001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 2208732662030 + 2208732662031.
It is an arithmetic number, because the mean of its divisors is an integer number (2208732662031).
Almost surely, 24417465324061 is an apocalyptic number.
It is an amenable number.
4417465324061 is a deficient number, since it is larger than the sum of its proper divisors (1).
4417465324061 is an equidigital number, since it uses as much as digits as its factorization.
4417465324061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1935360, while the sum is 47.
The spelling of 4417465324061 in words is "four trillion, four hundred seventeen billion, four hundred sixty-five million, three hundred twenty-four thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •