Base | Representation |
---|---|
bin | 11010001111100111… |
… | …01110110110000001 |
3 | 1100100221011011000001 |
4 | 31013303232312001 |
5 | 212323422123231 |
6 | 10250034000001 |
7 | 1006104003334 |
oct | 150763566601 |
9 | 40327134001 |
10 | 14089645441 |
11 | 5a80268183 |
12 | 2892716001 |
13 | 1437068611 |
14 | 97937061b |
15 | 576e3eb61 |
hex | 347ceed81 |
14089645441 has 8 divisors (see below), whose sum is σ = 14919501024. Its totient is φ = 13259906880.
The previous prime is 14089645397. The next prime is 14089645459. The reversal of 14089645441 is 14454698041.
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 14089645441 - 27 = 14089645313 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14089645391 and 14089645400.
It is not an unprimeable number, because it can be changed into a prime (14089645841) 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, 392346 + ... + 426748.
It is an arithmetic number, because the mean of its divisors is an integer number (1864937628).
Almost surely, 214089645441 is an apocalyptic number.
It is an amenable number.
14089645441 is a deficient number, since it is larger than the sum of its proper divisors (829855583).
14089645441 is a wasteful number, since it uses less digits than its factorization.
14089645441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 58511.
The product of its (nonzero) digits is 552960, while the sum is 46.
It can be divided in two parts, 14089645 and 441, that added together give a triangular number (14090086 = T5308).
The spelling of 14089645441 in words is "fourteen billion, eighty-nine million, six hundred forty-five thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •