Base | Representation |
---|---|
bin | 11010100100101111… |
… | …00010101100111101 |
3 | 1100211021111210022011 |
4 | 31102113202230331 |
5 | 213204300230203 |
6 | 10315403051221 |
7 | 1013354561554 |
oct | 152227425475 |
9 | 40737453264 |
10 | 14266805053 |
11 | 606126a886 |
12 | 2921b10b11 |
13 | 14649866a7 |
14 | 994ac8d9b |
15 | 58778676d |
hex | 3525e2b3d |
14266805053 has 8 divisors (see below), whose sum is σ = 14539714488. Its totient is φ = 13994033664.
The previous prime is 14266805023. The next prime is 14266805057. The reversal of 14266805053 is 35050866241.
It can be written as a sum of positive squares in 4 ways, for example, as 63409369 + 14203395684 = 7963^2 + 119178^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 14266805053 - 225 = 14233250621 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14266804997 and 14266805015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14266805057) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 187701 + ... + 252517.
It is an arithmetic number, because the mean of its divisors is an integer number (1817464311).
Almost surely, 214266805053 is an apocalyptic number.
It is an amenable number.
14266805053 is a deficient number, since it is larger than the sum of its proper divisors (272909435).
14266805053 is an equidigital number, since it uses as much as digits as its factorization.
14266805053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 69023.
The product of its (nonzero) digits is 172800, while the sum is 40.
The spelling of 14266805053 in words is "fourteen billion, two hundred sixty-six million, eight hundred five thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •