Base | Representation |
---|---|
bin | 1011001110010011101010… |
… | …0101110011110100001111 |
3 | 1121200201210100221200220112 |
4 | 2303210322211303310033 |
5 | 3104141142023002003 |
6 | 42125040150310235 |
7 | 2412365132360201 |
oct | 263447245636417 |
9 | 47621710850815 |
10 | 12340424031503 |
11 | 3a285a97192a7 |
12 | 14737a705837b |
13 | 6b690a3a7759 |
14 | 3093cb74a771 |
15 | 1660094253d8 |
hex | b393a973d0f |
12340424031503 has 4 divisors (see below), whose sum is σ = 12340468292520. Its totient is φ = 12340379770488.
The previous prime is 12340424031461. The next prime is 12340424031511. The reversal of 12340424031503 is 30513042404321.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 12340424031503 - 210 = 12340424030479 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 12340424031503.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (12340424031583) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 21709625 + ... + 22270802.
It is an arithmetic number, because the mean of its divisors is an integer number (3085117073130).
Almost surely, 212340424031503 is an apocalyptic number.
12340424031503 is a deficient number, since it is larger than the sum of its proper divisors (44261017).
12340424031503 is an equidigital number, since it uses as much as digits as its factorization.
12340424031503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 44261016.
The product of its (nonzero) digits is 34560, while the sum is 32.
Adding to 12340424031503 its reverse (30513042404321), we get a palindrome (42853466435824).
The spelling of 12340424031503 in words is "twelve trillion, three hundred forty billion, four hundred twenty-four million, thirty-one thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •