Base | Representation |
---|---|
bin | 1000011011110001000… |
… | …1100110000111010101 |
3 | 111211222211002020201021 |
4 | 2012330101212013111 |
5 | 4333220004244231 |
6 | 150321320201141 |
7 | 13316401126564 |
oct | 2067421460725 |
9 | 454884066637 |
10 | 144892649941 |
11 | 564a313a496 |
12 | 240b83091b1 |
13 | 10881405730 |
14 | 7027347bdb |
15 | 3b80520811 |
hex | 21bc4661d5 |
144892649941 has 4 divisors (see below), whose sum is σ = 156038238412. Its totient is φ = 133747061472.
The previous prime is 144892649939. The next prime is 144892649947. The reversal of 144892649941 is 149946298441.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 90006000100 + 54886649841 = 300010^2 + 234279^2 .
It is a cyclic number.
It is not a de Polignac number, because 144892649941 - 21 = 144892649939 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 144892649941.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144892649947) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 5572794216 + ... + 5572794241.
It is an arithmetic number, because the mean of its divisors is an integer number (39009559603).
Almost surely, 2144892649941 is an apocalyptic number.
It is an amenable number.
144892649941 is a deficient number, since it is larger than the sum of its proper divisors (11145588471).
144892649941 is a wasteful number, since it uses less digits than its factorization.
144892649941 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 11145588470.
The product of its digits is 17915904, while the sum is 61.
The spelling of 144892649941 in words is "one hundred forty-four billion, eight hundred ninety-two million, six hundred forty-nine thousand, nine hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •