Base | Representation |
---|---|
bin | 1100101110111011101101… |
… | …0000010101111001101001 |
3 | 1211120102120201221100121202 |
4 | 3023232323100111321221 |
5 | 3313340400122303230 |
6 | 45435414030413545 |
7 | 2643332645551112 |
oct | 313567320257151 |
9 | 54512521840552 |
10 | 14000440041065 |
11 | 450860a459a95 |
12 | 16a14670612b5 |
13 | 7a730b17498a |
14 | 3658a6a97209 |
15 | 1942b4870a45 |
hex | cbbbb415e69 |
14000440041065 has 4 divisors (see below), whose sum is σ = 16800528049284. Its totient is φ = 11200352032848.
The previous prime is 14000440041059. The next prime is 14000440041067. The reversal of 14000440041065 is 56014004400041.
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 10956503823721 + 3043936217344 = 3310061^2 + 1744688^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-14000440041065 is a prime.
It is a super-2 number, since 2×140004400410652 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14000440041067) 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, 1400044004102 + ... + 1400044004111.
It is an arithmetic number, because the mean of its divisors is an integer number (4200132012321).
Almost surely, 214000440041065 is an apocalyptic number.
It is an amenable number.
14000440041065 is a deficient number, since it is larger than the sum of its proper divisors (2800088008219).
14000440041065 is an equidigital number, since it uses as much as digits as its factorization.
14000440041065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2800088008218.
The product of its (nonzero) digits is 7680, while the sum is 29.
The spelling of 14000440041065 in words is "fourteen trillion, four hundred forty million, forty-one thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •