Base | Representation |
---|---|
bin | 11010001000101010… |
… | …10011001101001001 |
3 | 1100012212102201211221 |
4 | 31010111103031021 |
5 | 212214010230030 |
6 | 10240152122041 |
7 | 1004465250622 |
oct | 150425231511 |
9 | 40185381757 |
10 | 14031336265 |
11 | 5a50361681 |
12 | 2877096321 |
13 | 1427c6114b |
14 | 971712a49 |
15 | 571c72e7a |
hex | 344553349 |
14031336265 has 4 divisors (see below), whose sum is σ = 16837603524. Its totient is φ = 11225069008.
The previous prime is 14031336251. The next prime is 14031336269. The reversal of 14031336265 is 56263313041.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 56263313041 = 13 ⋅4327947157.
It can be written as a sum of positive squares in 2 ways, for example, as 4553145529 + 9478190736 = 67477^2 + 97356^2 .
It is a cyclic number.
It is not a de Polignac number, because 14031336265 - 221 = 14029239113 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 14031336265.
It is not an unprimeable number, because it can be changed into a prime (14031336269) 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, 1403133622 + ... + 1403133631.
It is an arithmetic number, because the mean of its divisors is an integer number (4209400881).
Almost surely, 214031336265 is an apocalyptic number.
It is an amenable number.
14031336265 is a deficient number, since it is larger than the sum of its proper divisors (2806267259).
14031336265 is an equidigital number, since it uses as much as digits as its factorization.
14031336265 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2806267258.
The product of its (nonzero) digits is 38880, while the sum is 34.
The spelling of 14031336265 in words is "fourteen billion, thirty-one million, three hundred thirty-six thousand, two hundred sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •