Base | Representation |
---|---|
bin | 1100001001010101001101… |
… | …0000110100111100010001 |
3 | 1202021200011121011111212001 |
4 | 3002111103100310330101 |
5 | 3222244403230241340 |
6 | 44222541051234001 |
7 | 2545553504065141 |
oct | 302252320647421 |
9 | 52250147144761 |
10 | 13354450243345 |
11 | 4289655015802 |
12 | 15b8222448901 |
13 | 75b41c52bb13 |
14 | 342504930921 |
15 | 1825a724b29a |
hex | c2553434f11 |
13354450243345 has 8 divisors (see below), whose sum is σ = 16041066834240. Its totient is φ = 10673075833200.
The previous prime is 13354450243331. The next prime is 13354450243363. The reversal of 13354450243345 is 54334205445331.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 13354450243345 - 219 = 13354449719057 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 13354450243295 and 13354450243304.
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 7 ways as a sum of consecutive naturals, for example, 1310539581 + ... + 1310549770.
It is an arithmetic number, because the mean of its divisors is an integer number (2005133354280).
Almost surely, 213354450243345 is an apocalyptic number.
It is an amenable number.
13354450243345 is a deficient number, since it is larger than the sum of its proper divisors (2686616590895).
13354450243345 is a wasteful number, since it uses less digits than its factorization.
13354450243345 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2621090375.
The product of its (nonzero) digits is 5184000, while the sum is 46.
Adding to 13354450243345 its reverse (54334205445331), we get a palindrome (67688655688676).
The spelling of 13354450243345 in words is "thirteen trillion, three hundred fifty-four billion, four hundred fifty million, two hundred forty-three thousand, three hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •