Base | Representation |
---|---|
bin | 11011101001101001… |
… | …10010010100101001 |
3 | 1102022120021212202110 |
4 | 31310310302110221 |
5 | 220400243142203 |
6 | 10453013352533 |
7 | 1033604352534 |
oct | 156464622451 |
9 | 42276255673 |
10 | 14844896553 |
11 | 6328614553 |
12 | 2a63638749 |
13 | 1527681276 |
14 | a0b7aba1b |
15 | 5bd3c7d03 |
hex | 374d32529 |
14844896553 has 8 divisors (see below), whose sum is σ = 20957501088. Its totient is φ = 9314444864.
The previous prime is 14844896537. The next prime is 14844896567. The reversal of 14844896553 is 35569844841.
14844896553 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 14844896553 - 24 = 14844896537 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14844896493 and 14844896502.
It is not an unprimeable number, because it can be changed into a prime (14844891553) 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 7 ways as a sum of consecutive naturals, for example, 145538151 + ... + 145538252.
It is an arithmetic number, because the mean of its divisors is an integer number (2619687636).
Almost surely, 214844896553 is an apocalyptic number.
It is an amenable number.
14844896553 is a deficient number, since it is larger than the sum of its proper divisors (6112604535).
14844896553 is a wasteful number, since it uses less digits than its factorization.
14844896553 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 291076423.
The product of its digits is 16588800, while the sum is 57.
The spelling of 14844896553 in words is "fourteen billion, eight hundred forty-four million, eight hundred ninety-six thousand, five hundred fifty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •