Base | Representation |
---|---|
bin | 1011001110010110111111… |
… | …1010101111111111011001 |
3 | 1121200211002201110020121120 |
4 | 2303211233322233333121 |
5 | 3104200010042311210 |
6 | 42125305030355453 |
7 | 2412426245136021 |
oct | 263455772577731 |
9 | 47624081406546 |
10 | 12341318713305 |
11 | 3a28a18748a4a |
12 | 14739b67bbb89 |
13 | 6b6a2085b57a |
14 | 3094744c0a81 |
15 | 16605cc51270 |
hex | b396feaffd9 |
12341318713305 has 8 divisors (see below), whose sum is σ = 19746109941312. Its totient is φ = 6582036647088.
The previous prime is 12341318713271. The next prime is 12341318713307. The reversal of 12341318713305 is 50331781314321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12341318713305 - 238 = 12066440806361 is a prime.
It is not an unprimeable number, because it can be changed into a prime (12341318713307) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 411377290429 + ... + 411377290458.
It is an arithmetic number, because the mean of its divisors is an integer number (2468263742664).
Almost surely, 212341318713305 is an apocalyptic number.
12341318713305 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
12341318713305 is a deficient number, since it is larger than the sum of its proper divisors (7404791228007).
12341318713305 is an equidigital number, since it uses as much as digits as its factorization.
12341318713305 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 822754580895.
The product of its (nonzero) digits is 181440, while the sum is 42.
The spelling of 12341318713305 in words is "twelve trillion, three hundred forty-one billion, three hundred eighteen million, seven hundred thirteen thousand, three hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •