Base | Representation |
---|---|
bin | 11010001111011100… |
… | …10110010001000101 |
3 | 1100100211111102221102 |
4 | 31013232112101011 |
5 | 212323041442203 |
6 | 10245543425445 |
7 | 1006056004445 |
oct | 150756262105 |
9 | 40324442842 |
10 | 14088234053 |
11 | 5a7a493843 |
12 | 2892155285 |
13 | 143699308a |
14 | 9790c4125 |
15 | 576c61888 |
hex | 347b96445 |
14088234053 has 12 divisors (see below), whose sum is σ = 14571647424. Its totient is φ = 13620389400.
The previous prime is 14088234049. The next prime is 14088234089. The reversal of 14088234053 is 35043288041.
It is a happy number.
14088234053 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 14088234053 - 22 = 14088234049 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 14088233998 and 14088234016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14088234023) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 1053338 + ... + 1066628.
It is an arithmetic number, because the mean of its divisors is an integer number (1214303952).
Almost surely, 214088234053 is an apocalyptic number.
It is an amenable number.
14088234053 is a deficient number, since it is larger than the sum of its proper divisors (483413371).
14088234053 is a wasteful number, since it uses less digits than its factorization.
14088234053 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14456 (or 14425 counting only the distinct ones).
The product of its (nonzero) digits is 92160, while the sum is 38.
The spelling of 14088234053 in words is "fourteen billion, eighty-eight million, two hundred thirty-four thousand, fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •