Base | Representation |
---|---|
bin | 111111000001110010000… |
… | …110110011010011101101 |
3 | 120100001200122212022011101 |
4 | 333001302012303103231 |
5 | 1031430340300420023 |
6 | 13113424515123101 |
7 | 624631125423604 |
oct | 77016206632355 |
9 | 16301618768141 |
10 | 4331241420013 |
11 | 141a961959152 |
12 | 59b50bba3491 |
13 | 255585256891 |
14 | 10d8c171ca3b |
15 | 779eb2611ad |
hex | 3f0721b34ed |
4331241420013 has 2 divisors, whose sum is σ = 4331241420014. Its totient is φ = 4331241420012.
The previous prime is 4331241419971. The next prime is 4331241420017. The reversal of 4331241420013 is 3100241421334.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 3143660203369 + 1187581216644 = 1773037^2 + 1089762^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-4331241420013 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (4331241420017) 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, 2165620710006 + 2165620710007.
It is an arithmetic number, because the mean of its divisors is an integer number (2165620710007).
Almost surely, 24331241420013 is an apocalyptic number.
It is an amenable number.
4331241420013 is a deficient number, since it is larger than the sum of its proper divisors (1).
4331241420013 is an equidigital number, since it uses as much as digits as its factorization.
4331241420013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6912, while the sum is 28.
Adding to 4331241420013 its reverse (3100241421334), we get a palindrome (7431482841347).
The spelling of 4331241420013 in words is "four trillion, three hundred thirty-one billion, two hundred forty-one million, four hundred twenty thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •