Base | Representation |
---|---|
bin | 100001101010010010000… |
… | …101011110011110010001 |
3 | 22012010121221020102110111 |
4 | 201222102011132132101 |
5 | 300344304142024241 |
6 | 4530350545001321 |
7 | 326055563521150 |
oct | 41522205363621 |
9 | 8163557212414 |
10 | 2313143314321 |
11 | 811aa9108724 |
12 | 314377023241 |
13 | 13a189362738 |
14 | 7dd573c5597 |
15 | 4028449bc81 |
hex | 21a9215e791 |
2313143314321 has 16 divisors (see below), whose sum is σ = 2667943050624. Its totient is φ = 1964443832064.
The previous prime is 2313143314309. The next prime is 2313143314337. The reversal of 2313143314321 is 1234133413132.
It is not a de Polignac number, because 2313143314321 - 213 = 2313143306129 is a prime.
It is a super-3 number, since 3×23131433143213 (a number of 38 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (2313143314021) 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 in 15 ways as a sum of consecutive naturals, for example, 1689666 + ... + 2735188.
It is an arithmetic number, because the mean of its divisors is an integer number (166746440664).
Almost surely, 22313143314321 is an apocalyptic number.
It is an amenable number.
2313143314321 is a deficient number, since it is larger than the sum of its proper divisors (354799736303).
2313143314321 is a wasteful number, since it uses less digits than its factorization.
2313143314321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1048440.
The product of its digits is 15552, while the sum is 31.
Adding to 2313143314321 its reverse (1234133413132), we get a palindrome (3547276727453).
The spelling of 2313143314321 in words is "two trillion, three hundred thirteen billion, one hundred forty-three million, three hundred fourteen thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •