Base | Representation |
---|---|
bin | 1011001100101101111111… |
… | …0111110100001010111001 |
3 | 1121121010100100121002021022 |
4 | 2303023133313310022321 |
5 | 3103214243322033423 |
6 | 42104324100152225 |
7 | 2410410615663653 |
oct | 263133767641271 |
9 | 47533310532238 |
10 | 12313132221113 |
11 | 3a17a741551a9 |
12 | 146a44b098675 |
13 | 6b417b105919 |
14 | 307d5cc676d3 |
15 | 16545d44cdc8 |
hex | b32dfdf42b9 |
12313132221113 has 8 divisors (see below), whose sum is σ = 12913051056000. Its totient is φ = 11718593824608.
The previous prime is 12313132221097. The next prime is 12313132221161. The reversal of 12313132221113 is 31112223131321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 12313132221113 - 24 = 12313132221097 is a prime.
It is a super-2 number, since 2×123131322211132 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12313132221713) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1345104908 + ... + 1345114061.
It is an arithmetic number, because the mean of its divisors is an integer number (1614131382000).
Almost surely, 212313132221113 is an apocalyptic number.
It is an amenable number.
12313132221113 is a deficient number, since it is larger than the sum of its proper divisors (599918834887).
12313132221113 is a wasteful number, since it uses less digits than its factorization.
12313132221113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2690219191.
The product of its digits is 1296, while the sum is 26.
Adding to 12313132221113 its reverse (31112223131321), we get a palindrome (43425355352434).
The spelling of 12313132221113 in words is "twelve trillion, three hundred thirteen billion, one hundred thirty-two million, two hundred twenty-one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.212 sec. • engine limits •