Base | Representation |
---|---|
bin | 1101000001001001010110… |
… | …1000000011001101011101 |
3 | 1212200100020100220222200122 |
4 | 3100102111220003031131 |
5 | 3334002210340144430 |
6 | 50235242551204325 |
7 | 3005050640633453 |
oct | 320222550031535 |
9 | 55610210828618 |
10 | 14313341334365 |
11 | 4619288042957 |
12 | 17320310766a5 |
13 | 7ca985a95338 |
14 | 376aab3cc9d3 |
15 | 19c4c9984ee5 |
hex | d0495a0335d |
14313341334365 has 4 divisors (see below), whose sum is σ = 17176009601244. Its totient is φ = 11450673067488.
The previous prime is 14313341334359. The next prime is 14313341334403. The reversal of 14313341334365 is 56343314331341.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 5654222935321 + 8659118399044 = 2377861^2 + 2942638^2 .
It is a cyclic number.
It is not a de Polignac number, because 14313341334365 - 26 = 14313341334301 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 (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1431334133432 + ... + 1431334133441.
It is an arithmetic number, because the mean of its divisors is an integer number (4294002400311).
Almost surely, 214313341334365 is an apocalyptic number.
It is an amenable number.
14313341334365 is a deficient number, since it is larger than the sum of its proper divisors (2862668266879).
14313341334365 is an equidigital number, since it uses as much as digits as its factorization.
14313341334365 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2862668266878.
The product of its digits is 1399680, while the sum is 44.
The spelling of 14313341334365 in words is "fourteen trillion, three hundred thirteen billion, three hundred forty-one million, three hundred thirty-four thousand, three hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.102 sec. • engine limits •