Base | Representation |
---|---|
bin | 1000011000101000001… |
… | …1101111010000010010 |
3 | 111202211002210011001210 |
4 | 2012022003233100102 |
5 | 4330003320002222 |
6 | 150101542440550 |
7 | 13256461061634 |
oct | 2061203572022 |
9 | 452732704053 |
10 | 144050156562 |
11 | 56100615774 |
12 | 23b02133156 |
13 | 107789c5140 |
14 | 6d874baa54 |
15 | 3b315a2d0c |
hex | 218a0ef412 |
144050156562 has 128 divisors (see below), whose sum is σ = 323979264000. Its totient is φ = 42394302720.
The previous prime is 144050156561. The next prime is 144050156567. The reversal of 144050156562 is 265651050441.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a self number, because there is not a number n which added to its sum of digits gives 144050156562.
It is not an unprimeable number, because it can be changed into a prime (144050156561) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 145357887 + ... + 145358877.
It is an arithmetic number, because the mean of its divisors is an integer number (2531088000).
Almost surely, 2144050156562 is an apocalyptic number.
It is a practical number, because each smaller number is the sum of distinct divisors of 144050156562, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (161989632000).
144050156562 is an abundant number, since it is smaller than the sum of its proper divisors (179929107438).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144050156562 is a wasteful number, since it uses less digits than its factorization.
144050156562 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1576.
The product of its (nonzero) digits is 144000, while the sum is 39.
The spelling of 144050156562 in words is "one hundred forty-four billion, fifty million, one hundred fifty-six thousand, five hundred sixty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •