Base | Representation |
---|---|
bin | 1100101111101101011001… |
… | …1010101111111010111111 |
3 | 1211121201000110122210200001 |
4 | 3023323112122233322333 |
5 | 3314100210321441212 |
6 | 45445501510215131 |
7 | 2644314356113462 |
oct | 313732632577277 |
9 | 54551013583601 |
10 | 14013780655807 |
11 | 4513235929329 |
12 | 16a3b6a9544a7 |
13 | 7a8655c94a5a |
14 | 3663b07692d9 |
15 | 1947e5b55657 |
hex | cbed66afebf |
14013780655807 has 4 divisors (see below), whose sum is σ = 14024911539240. Its totient is φ = 14002649772376.
The previous prime is 14013780655789. The next prime is 14013780655811. The reversal of 14013780655807 is 70855608731041.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14013780655807 - 215 = 14013780623039 is a prime.
It is a super-3 number, since 3×140137806558073 (a number of 40 digits) contains 333 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14013780655817) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5565439828 + ... + 5565442345.
It is an arithmetic number, because the mean of its divisors is an integer number (3506227884810).
Almost surely, 214013780655807 is an apocalyptic number.
14013780655807 is a deficient number, since it is larger than the sum of its proper divisors (11130883433).
14013780655807 is a wasteful number, since it uses less digits than its factorization.
14013780655807 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11130883432.
The product of its (nonzero) digits is 5644800, while the sum is 55.
The spelling of 14013780655807 in words is "fourteen trillion, thirteen billion, seven hundred eighty million, six hundred fifty-five thousand, eight hundred seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •