Base | Representation |
---|---|
bin | 1100000110011010001111… |
… | …1000111111010110000101 |
3 | 1202002212121222122202000121 |
4 | 3001212203320333112011 |
5 | 3220434112403411240 |
6 | 44143521051541541 |
7 | 2542126022336656 |
oct | 301464370772605 |
9 | 52085558582017 |
10 | 13304263341445 |
11 | 426a3408a657a |
12 | 15aa556a5a8b1 |
13 | 756781b3c86b |
14 | 33dd0346b52d |
15 | 18111b28804a |
hex | c19a3e3f585 |
13304263341445 has 8 divisors (see below), whose sum is σ = 16157466805536. Its totient is φ = 10515176809296.
The previous prime is 13304263341361. The next prime is 13304263341461. The reversal of 13304263341445 is 54414336240331.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 13304263341445 - 29 = 13304263340933 is a prime.
It is a Duffinian number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 16029232527 + ... + 16029233356.
It is an arithmetic number, because the mean of its divisors is an integer number (2019683350692).
Almost surely, 213304263341445 is an apocalyptic number.
It is an amenable number.
13304263341445 is a deficient number, since it is larger than the sum of its proper divisors (2853203464091).
13304263341445 is an equidigital number, since it uses as much as digits as its factorization.
13304263341445 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 32058465971.
The product of its (nonzero) digits is 1244160, while the sum is 43.
Adding to 13304263341445 its reverse (54414336240331), we get a palindrome (67718599581776).
The spelling of 13304263341445 in words is "thirteen trillion, three hundred four billion, two hundred sixty-three million, three hundred forty-one thousand, four hundred forty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •