Base | Representation |
---|---|
bin | 1011001100101101111111… |
… | …0111011011111111110111 |
3 | 1121121010100100102001110021 |
4 | 2303023133313123333313 |
5 | 3103214243310401403 |
6 | 42104324054110011 |
7 | 2410410615102211 |
oct | 263133767337767 |
9 | 47533310361407 |
10 | 12313132122103 |
11 | 3a17a7409787a |
12 | 146a44b04b307 |
13 | 6b417b09c837 |
14 | 307d5cc3d5b1 |
15 | 16545d42d8bd |
hex | b32dfddbff7 |
12313132122103 has 4 divisors (see below), whose sum is σ = 12313269361240. Its totient is φ = 12312994882968.
The previous prime is 12313132122091. The next prime is 12313132122143. The reversal of 12313132122103 is 30122123131321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12313132122103 is a prime.
It is a super-2 number, since 2×123131321221032 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12313132122143) 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, 68484900 + ... + 68664457.
It is an arithmetic number, because the mean of its divisors is an integer number (3078317340310).
Almost surely, 212313132122103 is an apocalyptic number.
12313132122103 is a deficient number, since it is larger than the sum of its proper divisors (137239137).
12313132122103 is an equidigital number, since it uses as much as digits as its factorization.
12313132122103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 137239136.
The product of its (nonzero) digits is 1296, while the sum is 25.
Adding to 12313132122103 its reverse (30122123131321), we get a palindrome (42435255253424).
The spelling of 12313132122103 in words is "twelve trillion, three hundred thirteen billion, one hundred thirty-two million, one hundred twenty-two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •