Base | Representation |
---|---|
bin | 1100001000101000011110… |
… | …0110001000110101100101 |
3 | 1202020112011211001210021212 |
4 | 3002022013212020311211 |
5 | 3222100310443440310 |
6 | 44213233413521205 |
7 | 2544650120112314 |
oct | 302120746106545 |
9 | 52215154053255 |
10 | 13342443343205 |
11 | 4284553480a39 |
12 | 15b5a31343205 |
13 | 75a257b1c692 |
14 | 341ac603827b |
15 | 1821030b6205 |
hex | c2287988d65 |
13342443343205 has 16 divisors (see below), whose sum is σ = 16054241076720. Its totient is φ = 10645083337728.
The previous prime is 13342443343189. The next prime is 13342443343241. The reversal of 13342443343205 is 50234334424331.
It can be written as a sum of positive squares in 8 ways, for example, as 300977320996 + 13041466022209 = 548614^2 + 3611297^2 .
It is a cyclic number.
It is not a de Polignac number, because 13342443343205 - 24 = 13342443343189 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 134732189 + ... + 134831181.
It is an arithmetic number, because the mean of its divisors is an integer number (1003390067295).
Almost surely, 213342443343205 is an apocalyptic number.
It is an amenable number.
13342443343205 is a deficient number, since it is larger than the sum of its proper divisors (2711797733515).
13342443343205 is an equidigital number, since it uses as much as digits as its factorization.
13342443343205 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171640.
The product of its (nonzero) digits is 1244160, while the sum is 41.
Adding to 13342443343205 its reverse (50234334424331), we get a palindrome (63576777767536).
The spelling of 13342443343205 in words is "thirteen trillion, three hundred forty-two billion, four hundred forty-three million, three hundred forty-three thousand, two hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •