Base | Representation |
---|---|
bin | 100001111011001100011… |
… | …0110110000010000010101 |
3 | 121111201222220000210102212 |
4 | 1003312120312300100111 |
5 | 1102343003111201141 |
6 | 13525545401243205 |
7 | 660601450064234 |
oct | 103663066602025 |
9 | 17451886023385 |
10 | 4662604006421 |
11 | 1538443453849 |
12 | 633788793505 |
13 | 27a8b282980a |
14 | 121957c3cb1b |
15 | 81441e9d2eb |
hex | 43d98db0415 |
4662604006421 has 2 divisors, whose sum is σ = 4662604006422. Its totient is φ = 4662604006420.
The previous prime is 4662604006363. The next prime is 4662604006427. The reversal of 4662604006421 is 1246004062664.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 2829423403921 + 1833180602500 = 1682089^2 + 1353950^2 .
It is a cyclic number.
It is not a de Polignac number, because 4662604006421 - 218 = 4662603744277 is a prime.
It is a super-2 number, since 2×46626040064212 (a number of 26 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4662604006427) 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, 2331302003210 + 2331302003211.
It is an arithmetic number, because the mean of its divisors is an integer number (2331302003211).
Almost surely, 24662604006421 is an apocalyptic number.
It is an amenable number.
4662604006421 is a deficient number, since it is larger than the sum of its proper divisors (1).
4662604006421 is an equidigital number, since it uses as much as digits as its factorization.
4662604006421 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 331776, while the sum is 41.
The spelling of 4662604006421 in words is "four trillion, six hundred sixty-two billion, six hundred four million, six thousand, four hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •