Base | Representation |
---|---|
bin | 100011100100001111111… |
… | …110110111110101110001 |
3 | 22122122122211212112220122 |
4 | 203210033332313311301 |
5 | 310021011230000223 |
6 | 5110450042220025 |
7 | 341403121510334 |
oct | 43441776676561 |
9 | 8578584775818 |
10 | 2444104531313 |
11 | 8625a2321365 |
12 | 3358257b4615 |
13 | 14962a415803 |
14 | 8641c3c461b |
15 | 4389b8d05c8 |
hex | 2390ffb7d71 |
2444104531313 has 4 divisors (see below), whose sum is σ = 2528383997940. Its totient is φ = 2359825064688.
The previous prime is 2444104531273. The next prime is 2444104531331. The reversal of 2444104531313 is 3131354014442.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 448869180529 + 1995235350784 = 669977^2 + 1412528^2 .
It is a cyclic number.
It is not a de Polignac number, because 2444104531313 - 212 = 2444104527217 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2444104531013) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 42139733270 + ... + 42139733327.
It is an arithmetic number, because the mean of its divisors is an integer number (632095999485).
Almost surely, 22444104531313 is an apocalyptic number.
It is an amenable number.
2444104531313 is a deficient number, since it is larger than the sum of its proper divisors (84279466627).
2444104531313 is an equidigital number, since it uses as much as digits as its factorization.
2444104531313 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 84279466626.
The product of its (nonzero) digits is 69120, while the sum is 35.
Adding to 2444104531313 its reverse (3131354014442), we get a palindrome (5575458545755).
The spelling of 2444104531313 in words is "two trillion, four hundred forty-four billion, one hundred four million, five hundred thirty-one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •