Base | Representation |
---|---|
bin | 1000011011110100010… |
… | …0110001011100010111 |
3 | 111212000202022211122202 |
4 | 2012331010301130113 |
5 | 4333231423100222 |
6 | 150322515515115 |
7 | 13316623143545 |
oct | 2067504613427 |
9 | 455022284582 |
10 | 144906065687 |
11 | 564aa772989 |
12 | 241008b8a9b |
13 | 10884121c46 |
14 | 702903ad95 |
15 | 3b817c0892 |
hex | 21bd131717 |
144906065687 has 2 divisors, whose sum is σ = 144906065688. Its totient is φ = 144906065686.
The previous prime is 144906065617. The next prime is 144906065693. The reversal of 144906065687 is 786560609441.
144906065687 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a strong prime.
It is a cyclic number.
It is not a de Polignac number, because 144906065687 - 214 = 144906049303 is a prime.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (144906065617) 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 as a sum of consecutive naturals, namely, 72453032843 + 72453032844.
It is an arithmetic number, because the mean of its divisors is an integer number (72453032844).
Almost surely, 2144906065687 is an apocalyptic number.
144906065687 is a deficient number, since it is larger than the sum of its proper divisors (1).
144906065687 is an equidigital number, since it uses as much as digits as its factorization.
144906065687 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 8709120, while the sum is 56.
The spelling of 144906065687 in words is "one hundred forty-four billion, nine hundred six million, sixty-five thousand, six hundred eighty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •