Base | Representation |
---|---|
bin | 100000101111011111111101… |
… | …011110101111001111000000 |
3 | 200212212102100120120002002202 |
4 | 200233133331132233033000 |
5 | 122333310310013221212 |
6 | 1230133233113332332 |
7 | 42221526262346654 |
oct | 4057377536571700 |
9 | 625772316502082 |
10 | 144001621226432 |
11 | 41979821082272 |
12 | 1419858b7070a8 |
13 | 62473aa3645c8 |
14 | 277ba03a88a64 |
15 | 119ac2c98a0c2 |
hex | 82f7fd7af3c0 |
144001621226432 has 56 divisors (see below), whose sum is σ = 301420821388800. Its totient is φ = 68068890452736.
The previous prime is 144001621226387. The next prime is 144001621226483. The reversal of 144001621226432 is 234622126100441.
It is a super-2 number, since 2×1440016212264322 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (38).
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 123031718 + ... + 124196645.
Almost surely, 2144001621226432 is an apocalyptic number.
It is an amenable number.
144001621226432 is an abundant number, since it is smaller than the sum of its proper divisors (157419200162368).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144001621226432 is a wasteful number, since it uses less digits than its factorization.
144001621226432 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 247228873 (or 247228863 counting only the distinct ones).
The product of its (nonzero) digits is 110592, while the sum is 38.
Adding to 144001621226432 its reverse (234622126100441), we get a palindrome (378623747326873).
The spelling of 144001621226432 in words is "one hundred forty-four trillion, one billion, six hundred twenty-one million, two hundred twenty-six thousand, four hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.086 sec. • engine limits •