Base | Representation |
---|---|
bin | 100000110001011011010000… |
… | …001011001110011111110000 |
3 | 200220100002001122012211010010 |
4 | 200301123100023032133300 |
5 | 122342442420302414211 |
6 | 1230314125311534520 |
7 | 42234224004041154 |
oct | 4061332013163760 |
9 | 626302048184103 |
10 | 144134005123056 |
11 | 41a1a9853651a3 |
12 | 141ba17682a440 |
13 | 6256a170a7150 |
14 | 27841a19c1064 |
15 | 119e3c9c434a6 |
hex | 8316d02ce7f0 |
144134005123056 has 80 divisors (see below), whose sum is σ = 401189395492256. Its totient is φ = 44326671925248.
The previous prime is 144134005122941. The next prime is 144134005123093. The reversal of 144134005123056 is 650321500431441.
It is a super-2 number, since 2×1441340051230562 (a number of 29 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
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, 56705185 + ... + 59192448.
Almost surely, 2144134005123056 is an apocalyptic number.
144134005123056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
144134005123056 is an abundant number, since it is smaller than the sum of its proper divisors (257055390369200).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
144134005123056 is a wasteful number, since it uses less digits than its factorization.
144134005123056 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 115899650 (or 115899644 counting only the distinct ones).
The product of its (nonzero) digits is 172800, while the sum is 39.
Adding to 144134005123056 its reverse (650321500431441), we get a palindrome (794455505554497).
The spelling of 144134005123056 in words is "one hundred forty-four trillion, one hundred thirty-four billion, five million, one hundred twenty-three thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •