Base | Representation |
---|---|
bin | 1000011001100101000… |
… | …0101101001001000101 |
3 | 111210110212201102010100 |
4 | 2012121100231021011 |
5 | 4331014113322041 |
6 | 150143133314313 |
7 | 13266006036453 |
oct | 2063120551105 |
9 | 453425642110 |
10 | 144305214021 |
11 | 56221593161 |
12 | 23b73635999 |
13 | 107b97b8807 |
14 | 6dad3119d3 |
15 | 3b48b856b6 |
hex | 219942d245 |
144305214021 has 6 divisors (see below), whose sum is σ = 208440864710. Its totient is φ = 96203476008.
The previous prime is 144305214007. The next prime is 144305214029. The reversal of 144305214021 is 120412503441.
144305214021 is a `hidden beast` number, since 1 + 443 + 0 + 5 + 214 + 0 + 2 + 1 = 666.
It can be written as a sum of positive squares in only one way, i.e., 74193588225 + 70111625796 = 272385^2 + 264786^2 .
It is not a de Polignac number, because 144305214021 - 221 = 144303116869 is a prime.
It is a super-2 number, since 2×1443052140212 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (144305214029) by changing a digit.
It is a polite number, since it can be written in 5 ways as a sum of consecutive naturals, for example, 8016956326 + ... + 8016956343.
Almost surely, 2144305214021 is an apocalyptic number.
It is an amenable number.
144305214021 is a deficient number, since it is larger than the sum of its proper divisors (64135650689).
144305214021 is a wasteful number, since it uses less digits than its factorization.
144305214021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16033912675 (or 16033912672 counting only the distinct ones).
The product of its (nonzero) digits is 3840, while the sum is 27.
Adding to 144305214021 its reverse (120412503441), we get a palindrome (264717717462).
The spelling of 144305214021 in words is "one hundred forty-four billion, three hundred five million, two hundred fourteen thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •