Base | Representation |
---|---|
bin | 1011001101110001101110… |
… | …0011010001111011000111 |
3 | 1121122212021102120121211201 |
4 | 2303130123203101323013 |
5 | 3104014012203340403 |
6 | 42120532132443331 |
7 | 2411623303644532 |
oct | 263343343217307 |
9 | 47585242517751 |
10 | 12331313340103 |
11 | 3a247539a3a7a |
12 | 1471a83a79547 |
13 | 6b5ab7a0c4b4 |
14 | 308ba575da19 |
15 | 165b7468121d |
hex | b371b8d1ec7 |
12331313340103 has 8 divisors (see below), whose sum is σ = 12361616692560. Its totient is φ = 12301010736960.
The previous prime is 12331313340043. The next prime is 12331313340113. The reversal of 12331313340103 is 30104331313321.
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 12331313340103 - 29 = 12331313339591 is a prime.
It is a super-2 number, since 2×123313133401032 (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 (12331313340113) 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, 47876301 + ... + 48133177.
It is an arithmetic number, because the mean of its divisors is an integer number (1545202086570).
Almost surely, 212331313340103 is an apocalyptic number.
12331313340103 is a deficient number, since it is larger than the sum of its proper divisors (30303352457).
12331313340103 is a wasteful number, since it uses less digits than its factorization.
12331313340103 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 374657.
The product of its (nonzero) digits is 5832, while the sum is 28.
Adding to 12331313340103 its reverse (30104331313321), we get a palindrome (42435644653424).
The spelling of 12331313340103 in words is "twelve trillion, three hundred thirty-one billion, three hundred thirteen million, three hundred forty thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •