Base | Representation |
---|---|
bin | 1000011011000001000… |
… | …0111010111101101101 |
3 | 111211110202220211002202 |
4 | 2012300100322331231 |
5 | 4332311413142410 |
6 | 150245321231245 |
7 | 13311403311365 |
oct | 2066020727555 |
9 | 454422824082 |
10 | 144691146605 |
11 | 563aa420005 |
12 | 24060932525 |
13 | 1084b7430a5 |
14 | 70086939a5 |
15 | 3b6c9baca5 |
hex | 21b043af6d |
144691146605 has 8 divisors (see below), whose sum is σ = 173806013952. Its totient is φ = 115635158608.
The previous prime is 144691146599. The next prime is 144691146667. The reversal of 144691146605 is 506641196441.
144691146605 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 144691146605 - 218 = 144690884461 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 144691146605.
It is a congruent number.
It is an unprimeable number.
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, 14714429 + ... + 14724258.
It is an arithmetic number, because the mean of its divisors is an integer number (21725751744).
Almost surely, 2144691146605 is an apocalyptic number.
It is an amenable number.
144691146605 is a deficient number, since it is larger than the sum of its proper divisors (29114867347).
144691146605 is an equidigital number, since it uses as much as digits as its factorization.
144691146605 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 29439675.
The product of its (nonzero) digits is 622080, while the sum is 47.
The spelling of 144691146605 in words is "one hundred forty-four billion, six hundred ninety-one million, one hundred forty-six thousand, six hundred five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •