Base | Representation |
---|---|
bin | 1011001110011101010011… |
… | …0100010011110111010011 |
3 | 1121200222110200202221101212 |
4 | 2303213110310103313103 |
5 | 3104211441422232201 |
6 | 42130145021250335 |
7 | 2412516221606225 |
oct | 263472464236723 |
9 | 47628420687355 |
10 | 12343011524051 |
11 | 3a2970725079a |
12 | 14741a97039ab |
13 | 6b6c3048b730 |
14 | 309595254415 |
15 | 16610b684abb |
hex | b39d4d13dd3 |
12343011524051 has 8 divisors (see below), whose sum is σ = 13306421993760. Its totient is φ = 11381593632192.
The previous prime is 12343011523951. The next prime is 12343011524069. The reversal of 12343011524051 is 15042511034321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-12343011524051 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 12343011523999 and 12343011524017.
It is not an unprimeable number, because it can be changed into a prime (12343011524251) 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, 498131591 + ... + 498156368.
It is an arithmetic number, because the mean of its divisors is an integer number (1663302749220).
Almost surely, 212343011524051 is an apocalyptic number.
12343011524051 is a deficient number, since it is larger than the sum of its proper divisors (963410469709).
12343011524051 is an equidigital number, since it uses as much as digits as its factorization.
12343011524051 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 996288925.
The product of its (nonzero) digits is 14400, while the sum is 32.
Adding to 12343011524051 its reverse (15042511034321), we get a palindrome (27385522558372).
The spelling of 12343011524051 in words is "twelve trillion, three hundred forty-three billion, eleven million, five hundred twenty-four thousand, fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •