Base | Representation |
---|---|
bin | 1000011000111011111… |
… | …1111010110100011000 |
3 | 111210000212202010201210 |
4 | 2012032333322310120 |
5 | 4330141024311212 |
6 | 150114103143120 |
7 | 13261515431532 |
oct | 2061677726430 |
9 | 453025663653 |
10 | 144133041432 |
11 | 56143387366 |
12 | 23b25a44aa0 |
13 | 1078cc25643 |
14 | 6d944d4852 |
15 | 3b389c653c |
hex | 218effad18 |
144133041432 has 32 divisors (see below), whose sum is σ = 367999257600. Its totient is φ = 47022126624.
The previous prime is 144133041407. The next prime is 144133041467. The reversal of 144133041432 is 234140331441.
It is a super-2 number, since 2×1441330414322 (a number of 23 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 144133041432.
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 63887632 + ... + 63889887.
It is an arithmetic number, because the mean of its divisors is an integer number (11499976800).
Almost surely, 2144133041432 is an apocalyptic number.
144133041432 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
144133041432 is an abundant number, since it is smaller than the sum of its proper divisors (223866216168).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144133041432 is a wasteful number, since it uses less digits than its factorization.
144133041432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 127777575 (or 127777571 counting only the distinct ones).
The product of its (nonzero) digits is 13824, while the sum is 30.
Adding to 144133041432 its reverse (234140331441), we get a palindrome (378273372873).
The spelling of 144133041432 in words is "one hundred forty-four billion, one hundred thirty-three million, forty-one thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •