Base | Representation |
---|---|
bin | 100000110010111110010011… |
… | …000001010101001111000001 |
3 | 200220201020120020002000222210 |
4 | 200302332103001111033001 |
5 | 122401213220421121231 |
6 | 1230435034210252333 |
7 | 42245010263454315 |
oct | 4062762301251701 |
9 | 626636506060883 |
10 | 144240353301441 |
11 | 41a60a99111711 |
12 | 142168b65870a9 |
13 | 6263a64b4b657 |
14 | 27893adba5b45 |
15 | 11a205143ea46 |
hex | 832f930553c1 |
144240353301441 has 8 divisors (see below), whose sum is σ = 192320526671424. Its totient is φ = 96160207732880.
The previous prime is 144240353301397. The next prime is 144240353301449. The reversal of 144240353301441 is 144103353042441.
It is a happy number.
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 144240353301441 - 29 = 144240353300929 is a prime.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 144240353301441.
It is not an unprimeable number, because it can be changed into a prime (144240353301449) 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, 15707215 + ... + 23134331.
It is an arithmetic number, because the mean of its divisors is an integer number (24040065833928).
Almost surely, 2144240353301441 is an apocalyptic number.
It is an amenable number.
144240353301441 is a deficient number, since it is larger than the sum of its proper divisors (48080173369983).
144240353301441 is an equidigital number, since it uses as much as digits as its factorization.
144240353301441 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13900711.
The product of its (nonzero) digits is 276480, while the sum is 39.
The spelling of 144240353301441 in words is "one hundred forty-four trillion, two hundred forty billion, three hundred fifty-three million, three hundred one thousand, four hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.096 sec. • engine limits •