Base | Representation |
---|---|
bin | 1011001101110001010110… |
… | …0100111110011001001111 |
3 | 1121122212000102222222012220 |
4 | 2303130111210332121033 |
5 | 3104013311024333403 |
6 | 42120514152430423 |
7 | 2411620646051052 |
oct | 263342544763117 |
9 | 47585012888186 |
10 | 12331213121103 |
11 | 3a24702372a58 |
12 | 1471a563a8413 |
13 | 6b5aa0020106 |
14 | 308b96312a99 |
15 | 165b6a986953 |
hex | b371593e64f |
12331213121103 has 8 divisors (see below), whose sum is σ = 16457752550400. Its totient is φ = 8212741219608.
The previous prime is 12331213121099. The next prime is 12331213121107. The reversal of 12331213121103 is 30112131213321.
It is an interprime number because it is at equal distance from previous prime (12331213121099) and next prime (12331213121107).
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12331213121103 - 22 = 12331213121099 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12331213121107) 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, 2016878383 + ... + 2016884496.
It is an arithmetic number, because the mean of its divisors is an integer number (2057219068800).
Almost surely, 212331213121103 is an apocalyptic number.
12331213121103 is a deficient number, since it is larger than the sum of its proper divisors (4126539429297).
12331213121103 is a wasteful number, since it uses less digits than its factorization.
12331213121103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4033763901.
The product of its (nonzero) digits is 648, while the sum is 24.
Adding to 12331213121103 its reverse (30112131213321), we get a palindrome (42443344334424).
The spelling of 12331213121103 in words is "twelve trillion, three hundred thirty-one billion, two hundred thirteen million, one hundred twenty-one thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •