Base | Representation |
---|---|
bin | 1011001110010100000110… |
… | …1101100101011011000001 |
3 | 1121200202002200202211212210 |
4 | 2303211001231211123001 |
5 | 3104141413114311314 |
6 | 42125100055212333 |
7 | 2412401113050465 |
oct | 263450155453301 |
9 | 47622080684783 |
10 | 12340543510209 |
11 | 3a28660104432 |
12 | 147381b0770a9 |
13 | 6b692907b305 |
14 | 3093dd56c4a5 |
15 | 166014b76559 |
hex | b3941b656c1 |
12340543510209 has 8 divisors (see below), whose sum is σ = 17320061067040. Its totient is φ = 7794027480096.
The previous prime is 12340543510201. The next prime is 12340543510241. The reversal of 12340543510209 is 90201534504321.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 12340543510209 - 23 = 12340543510201 is a prime.
It is a super-2 number, since 2×123405435102092 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (12340543510201) 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, 108250381612 + ... + 108250381725.
It is an arithmetic number, because the mean of its divisors is an integer number (2165007633380).
Almost surely, 212340543510209 is an apocalyptic number.
12340543510209 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
12340543510209 is a deficient number, since it is larger than the sum of its proper divisors (4979517556831).
12340543510209 is a wasteful number, since it uses less digits than its factorization.
12340543510209 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 216500763359.
The product of its (nonzero) digits is 129600, while the sum is 39.
The spelling of 12340543510209 in words is "twelve trillion, three hundred forty billion, five hundred forty-three million, five hundred ten thousand, two hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •