Base | Representation |
---|---|
bin | 1100101110111001000110… |
… | …0100100010000101111001 |
3 | 1211120100202222222200102102 |
4 | 3023232101210202011321 |
5 | 3313332432104101214 |
6 | 45435220405113145 |
7 | 2643306424304066 |
oct | 313562144420571 |
9 | 54510688880372 |
10 | 13999740690809 |
11 | 4508290713875 |
12 | 16a12b09b87b5 |
13 | 7a7229302263 |
14 | 36583bc4bc6d |
15 | 19427327abde |
hex | cbb91922179 |
13999740690809 has 4 divisors (see below), whose sum is σ = 14736569148240. Its totient is φ = 13262912233380.
The previous prime is 13999740690781. The next prime is 13999740690883. The reversal of 13999740690809 is 90809604799931.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 13999740690809 - 232 = 13995445723513 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13999740698809) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 368414228687 + ... + 368414228724.
It is an arithmetic number, because the mean of its divisors is an integer number (3684142287060).
Almost surely, 213999740690809 is an apocalyptic number.
13999740690809 is a gapful number since it is divisible by the number (19) formed by its first and last digit.
It is an amenable number.
13999740690809 is a deficient number, since it is larger than the sum of its proper divisors (736828457431).
13999740690809 is an equidigital number, since it uses as much as digits as its factorization.
13999740690809 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 736828457430.
The product of its (nonzero) digits is 238085568, while the sum is 74.
The spelling of 13999740690809 in words is "thirteen trillion, nine hundred ninety-nine billion, seven hundred forty million, six hundred ninety thousand, eight hundred nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •