Base | Representation |
---|---|
bin | 11010001001101011… |
… | …00100000000000001 |
3 | 1100020110100102012222 |
4 | 31010311210000001 |
5 | 212223141344130 |
6 | 10241053300425 |
7 | 1004630164022 |
oct | 150465440001 |
9 | 40213312188 |
10 | 14039793665 |
11 | 5a55108867 |
12 | 2879a94715 |
13 | 1429932821 |
14 | 9728b4c49 |
15 | 572893ce5 |
hex | 344d64001 |
14039793665 has 8 divisors (see below), whose sum is σ = 16851761640. Its totient is φ = 11229162112.
The previous prime is 14039793659. The next prime is 14039793697. The reversal of 14039793665 is 56639793041.
It can be written as a sum of positive squares in 4 ways, for example, as 4199947249 + 9839846416 = 64807^2 + 99196^2 .
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 14039793665 - 26 = 14039793601 is a prime.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 310844 + ... + 353133.
It is an arithmetic number, because the mean of its divisors is an integer number (2106470205).
Almost surely, 214039793665 is an apocalyptic number.
It is an amenable number.
14039793665 is a deficient number, since it is larger than the sum of its proper divisors (2811967975).
14039793665 is an equidigital number, since it uses as much as digits as its factorization.
14039793665 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 668211.
The product of its (nonzero) digits is 3674160, while the sum is 53.
The spelling of 14039793665 in words is "fourteen billion, thirty-nine million, seven hundred ninety-three thousand, six hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •