Base | Representation |
---|---|
bin | 1000011000101000101… |
… | …1001110111000100101 |
3 | 111202211020110221221101 |
4 | 2012022023032320211 |
5 | 4330004320334000 |
6 | 150102052520101 |
7 | 13256513553343 |
oct | 2061213167045 |
9 | 452736427841 |
10 | 144052121125 |
11 | 56101737780 |
12 | 23b02920031 |
13 | 107792323c3 |
14 | 6d8786c993 |
15 | 3b3183ee6a |
hex | 218a2cee25 |
144052121125 has 64 divisors (see below), whose sum is σ = 201430644480. Its totient is φ = 101964000000.
The previous prime is 144052121119. The next prime is 144052121177. The reversal of 144052121125 is 521121250441.
It is not a de Polignac number, because 144052121125 - 25 = 144052121093 is a prime.
It is a super-2 number, since 2×1440521211252 (a number of 23 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 144052121093 and 144052121102.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 8184835 + ... + 8202415.
It is an arithmetic number, because the mean of its divisors is an integer number (3147353820).
Almost surely, 2144052121125 is an apocalyptic number.
It is an amenable number.
144052121125 is a deficient number, since it is larger than the sum of its proper divisors (57378523355).
144052121125 is a wasteful number, since it uses less digits than its factorization.
144052121125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17767 (or 17757 counting only the distinct ones).
The product of its (nonzero) digits is 3200, while the sum is 28.
Adding to 144052121125 its reverse (521121250441), we get a palindrome (665173371566).
The spelling of 144052121125 in words is "one hundred forty-four billion, fifty-two million, one hundred twenty-one thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •