Base | Representation |
---|---|
bin | 100000110010111111001101… |
… | …010111001100111001110011 |
3 | 200220201100002102212211001011 |
4 | 200302333031113030321303 |
5 | 122401222222010104021 |
6 | 1230435315253451351 |
7 | 42245043450306340 |
oct | 4062771527147163 |
9 | 626640072784034 |
10 | 144241332113011 |
11 | 41a614506832a1 |
12 | 14216b2a340b57 |
13 | 6263b8c87a4b3 |
14 | 2789463b997c7 |
15 | 11a20ac337de1 |
hex | 832fcd5cce73 |
144241332113011 has 8 divisors (see below), whose sum is σ = 164854343289440. Its totient is φ = 123630097583808.
The previous prime is 144241332112987. The next prime is 144241332113027. The reversal of 144241332113011 is 110311233142441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 144241332113011 - 219 = 144241331588723 is a prime.
It is a super-2 number, since 2×1442413321130112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (144241332113051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 443987826 + ... + 444312583.
It is an arithmetic number, because the mean of its divisors is an integer number (20606792911180).
Almost surely, 2144241332113011 is an apocalyptic number.
144241332113011 is a deficient number, since it is larger than the sum of its proper divisors (20613011176429).
144241332113011 is an equidigital number, since it uses as much as digits as its factorization.
144241332113011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 888323613.
The product of its (nonzero) digits is 6912, while the sum is 31.
Adding to 144241332113011 its reverse (110311233142441), we get a palindrome (254552565255452).
The spelling of 144241332113011 in words is "one hundred forty-four trillion, two hundred forty-one billion, three hundred thirty-two million, one hundred thirteen thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •