Base | Representation |
---|---|
bin | 100011100010100111000… |
… | …100100110011000110101 |
3 | 22122111010011220212222102 |
4 | 203202213010212120311 |
5 | 310003410133100023 |
6 | 5105555245111445 |
7 | 341311400036153 |
oct | 43424704463065 |
9 | 8574104825872 |
10 | 2442344425013 |
11 | 861879835459 |
12 | 335414258585 |
13 | 149409882aac |
14 | 862d27343d3 |
15 | 437e7107628 |
hex | 238a7126635 |
2442344425013 has 2 divisors, whose sum is σ = 2442344425014. Its totient is φ = 2442344425012.
The previous prime is 2442344425009. The next prime is 2442344425043. The reversal of 2442344425013 is 3105244432442.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1281654938404 + 1160689486609 = 1132102^2 + 1077353^2 .
It is a cyclic number.
It is not a de Polignac number, because 2442344425013 - 22 = 2442344425009 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (2442344425043) 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, 1221172212506 + 1221172212507.
It is an arithmetic number, because the mean of its divisors is an integer number (1221172212507).
Almost surely, 22442344425013 is an apocalyptic number.
It is an amenable number.
2442344425013 is a deficient number, since it is larger than the sum of its proper divisors (1).
2442344425013 is an equidigital number, since it uses as much as digits as its factorization.
2442344425013 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 368640, while the sum is 38.
Adding to 2442344425013 its reverse (3105244432442), we get a palindrome (5547588857455).
The spelling of 2442344425013 in words is "two trillion, four hundred forty-two billion, three hundred forty-four million, four hundred twenty-five thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •