Base | Representation |
---|---|
bin | 100001101010011100101… |
… | …111100110111111010101 |
3 | 22012011002101201021101202 |
4 | 201222130233212333111 |
5 | 300400140431201123 |
6 | 4530420413402245 |
7 | 326063164451606 |
oct | 41523457467725 |
9 | 8164071637352 |
10 | 2313322131413 |
11 | 812090042647 |
12 | 314406a99385 |
13 | 13a1b7411077 |
14 | 7dd73051dad |
15 | 4029501ea28 |
hex | 21a9cbe6fd5 |
2313322131413 has 4 divisors (see below), whose sum is σ = 2313725084748. Its totient is φ = 2312919178080.
The previous prime is 2313322131377. The next prime is 2313322131437. The reversal of 2313322131413 is 3141312233132.
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 703689455044 + 1609632676369 = 838862^2 + 1268713^2 .
It is a cyclic number.
It is not a de Polignac number, because 2313322131413 - 210 = 2313322130389 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2313322131473) 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, 201468056 + ... + 201479537.
It is an arithmetic number, because the mean of its divisors is an integer number (578431271187).
Almost surely, 22313322131413 is an apocalyptic number.
It is an amenable number.
2313322131413 is a deficient number, since it is larger than the sum of its proper divisors (402953335).
2313322131413 is an equidigital number, since it uses as much as digits as its factorization.
2313322131413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 402953334.
The product of its digits is 7776, while the sum is 29.
Adding to 2313322131413 its reverse (3141312233132), we get a palindrome (5454634364545).
The spelling of 2313322131413 in words is "two trillion, three hundred thirteen billion, three hundred twenty-two million, one hundred thirty-one thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •