Base | Representation |
---|---|
bin | 11010001000110011… |
… | …00100000110100101 |
3 | 1100012221112112011111 |
4 | 31010121210012211 |
5 | 212214302012203 |
6 | 10240232105021 |
7 | 1004510614522 |
oct | 150431440645 |
9 | 40187475144 |
10 | 14032454053 |
11 | 5a50a55472 |
12 | 2877535171 |
13 | 1428262b67 |
14 | 971924149 |
15 | 571de426d |
hex | 3446641a5 |
14032454053 has 4 divisors (see below), whose sum is σ = 14059388268. Its totient is φ = 14005519840.
The previous prime is 14032454039. The next prime is 14032454081. The reversal of 14032454053 is 35045423041.
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 4203317889 + 9829136164 = 64833^2 + 99142^2 .
It is a cyclic number.
It is not a de Polignac number, because 14032454053 - 25 = 14032454021 is a prime.
It is a super-2 number, since 2×140324540532 (a number of 21 digits) contains 22 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 (14032457053) 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, 13466326 + ... + 13467367.
It is an arithmetic number, because the mean of its divisors is an integer number (3514847067).
Almost surely, 214032454053 is an apocalyptic number.
It is an amenable number.
14032454053 is a deficient number, since it is larger than the sum of its proper divisors (26934215).
14032454053 is an equidigital number, since it uses as much as digits as its factorization.
14032454053 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26934214.
The product of its (nonzero) digits is 28800, while the sum is 31.
Adding to 14032454053 its reverse (35045423041), we get a palindrome (49077877094).
The spelling of 14032454053 in words is "fourteen billion, thirty-two million, four hundred fifty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •