Base | Representation |
---|---|
bin | 1011001110011111110111… |
… | …1111010011101001110111 |
3 | 1121201001020211112121022121 |
4 | 2303213331333103221313 |
5 | 3104214400240211011 |
6 | 42130341334340411 |
7 | 2412542310066412 |
oct | 263477577235167 |
9 | 47631224477277 |
10 | 12343702272631 |
11 | 3a29a31151394 |
12 | 1474360aba707 |
13 | 6b701060bbc2 |
14 | 30961cca0b79 |
15 | 16614c12ae71 |
hex | b39fdfd3a77 |
12343702272631 has 8 divisors (see below), whose sum is σ = 12385608007680. Its totient is φ = 12301846938072.
The previous prime is 12343702272617. The next prime is 12343702272653. The reversal of 12343702272631 is 13627220734321.
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 12343702272631 - 29 = 12343702272119 is a prime.
It is a super-2 number, since 2×123437022726312 (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 (12343702242631) 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, 12109435 + ... + 13089148.
It is an arithmetic number, because the mean of its divisors is an integer number (1548201000960).
Almost surely, 212343702272631 is an apocalyptic number.
12343702272631 is a deficient number, since it is larger than the sum of its proper divisors (41905735049).
12343702272631 is a wasteful number, since it uses less digits than its factorization.
12343702272631 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 25200245.
The product of its (nonzero) digits is 508032, while the sum is 43.
The spelling of 12343702272631 in words is "twelve trillion, three hundred forty-three billion, seven hundred two million, two hundred seventy-two thousand, six hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •