Base | Representation |
---|---|
bin | 10011101111110100101010… |
… | …01001011010010111110101 |
3 | 12200202100112112201022110002 |
4 | 21313322111021122113311 |
5 | 21142432111114310221 |
6 | 232204555031041045 |
7 | 12101216414460332 |
oct | 1167722511322765 |
9 | 180670475638402 |
10 | 43424621635061 |
11 | 12922307920a77 |
12 | 4a53b95b10185 |
13 | 1b2cc02764314 |
14 | aa1a97589989 |
15 | 5048926dd80b |
hex | 277e9525a5f5 |
43424621635061 has 2 divisors, whose sum is σ = 43424621635062. Its totient is φ = 43424621635060.
The previous prime is 43424621635019. The next prime is 43424621635067. The reversal of 43424621635061 is 16053612642434.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 34409885608036 + 9014736027025 = 5865994^2 + 3002455^2 .
It is a cyclic number.
It is not a de Polignac number, because 43424621635061 - 242 = 39026575123957 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 43424621634997 and 43424621635015.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (43424621635067) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 21712310817530 + 21712310817531.
It is an arithmetic number, because the mean of its divisors is an integer number (21712310817531).
Almost surely, 243424621635061 is an apocalyptic number.
It is an amenable number.
43424621635061 is a deficient number, since it is larger than the sum of its proper divisors (1).
43424621635061 is an equidigital number, since it uses as much as digits as its factorization.
43424621635061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2488320, while the sum is 47.
The spelling of 43424621635061 in words is "forty-three trillion, four hundred twenty-four billion, six hundred twenty-one million, six hundred thirty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •