Base | Representation |
---|---|
bin | 1011011000011011001011… |
… | …1100110001110011100111 |
3 | 1122022100110001010220101112 |
4 | 2312012302330301303213 |
5 | 3120013131423312333 |
6 | 42340544033015235 |
7 | 2431060403665043 |
oct | 266066274616347 |
9 | 48270401126345 |
10 | 12514242010343 |
11 | 3a95295407487 |
12 | 14a14163b451b |
13 | 6ca11b3223c8 |
14 | 31399a4b5023 |
15 | 16a7ce03d948 |
hex | b61b2f31ce7 |
12514242010343 has 4 divisors (see below), whose sum is σ = 12591016501368. Its totient is φ = 12437467519320.
The previous prime is 12514242010321. The next prime is 12514242010373. The reversal of 12514242010343 is 34301024241521.
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 12514242010343 - 224 = 12514225233127 is a prime.
It is a super-2 number, since 2×125142420103432 (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 (12514242010313) 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, 38387245268 + ... + 38387245593.
It is an arithmetic number, because the mean of its divisors is an integer number (3147754125342).
Almost surely, 212514242010343 is an apocalyptic number.
12514242010343 is a deficient number, since it is larger than the sum of its proper divisors (76774491025).
12514242010343 is an equidigital number, since it uses as much as digits as its factorization.
12514242010343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76774491024.
The product of its (nonzero) digits is 23040, while the sum is 32.
Adding to 12514242010343 its reverse (34301024241521), we get a palindrome (46815266251864).
The spelling of 12514242010343 in words is "twelve trillion, five hundred fourteen billion, two hundred forty-two million, ten thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •