Base | Representation |
---|---|
bin | 10001001010110… |
… | …01101001100100 |
3 | 101001000002012110 |
4 | 20211121221210 |
5 | 243332201431 |
6 | 22142521020 |
7 | 3366111360 |
oct | 1045315144 |
9 | 331002173 |
10 | 144022116 |
11 | 74329a47 |
12 | 40296170 |
13 | 23ab7cb4 |
14 | 151b02a0 |
15 | c99d346 |
hex | 8959a64 |
144022116 has 48 divisors (see below), whose sum is σ = 387483264. Its totient is φ = 40782336.
The previous prime is 144022069. The next prime is 144022129. The reversal of 144022116 is 611220441.
It is a happy number.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a junction number, because it is equal to n+sod(n) for n = 144022092 and 144022101.
It is an unprimeable number.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 1906 + ... + 17078.
It is an arithmetic number, because the mean of its divisors is an integer number (8072568).
Almost surely, 2144022116 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144022116, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (193741632).
144022116 is an abundant number, since it is smaller than the sum of its proper divisors (243461148).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144022116 is a wasteful number, since it uses less digits than its factorization.
144022116 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 15300 (or 15298 counting only the distinct ones).
The product of its (nonzero) digits is 384, while the sum is 21.
The square root of 144022116 is about 12000.9214646210. The cubic root of 144022116 is about 524.1751109481.
Adding to 144022116 its reverse (611220441), we get a palindrome (755242557).
The spelling of 144022116 in words is "one hundred forty-four million, twenty-two thousand, one hundred sixteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •