Base | Representation |
---|---|
bin | 100000110001000101000001… |
… | …110001111110111001111010 |
3 | 200220020210110112020020011021 |
4 | 200301011001301332321322 |
5 | 122342100032133220232 |
6 | 1230255141315253054 |
7 | 42232420433655025 |
oct | 4061050161767172 |
9 | 626223415206137 |
10 | 144110141304442 |
11 | 41a10849906055 |
12 | 141b56168aa18a |
13 | 62546b307c011 |
14 | 2782d7a4b41bc |
15 | 119d97eba2397 |
hex | 831141c7ee7a |
144110141304442 has 8 divisors (see below), whose sum is σ = 216165470217696. Its totient is φ = 72054984565212.
The previous prime is 144110141304427. The next prime is 144110141304443. The reversal of 144110141304442 is 244403141011441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 144110141304398 and 144110141304407.
It is not an unprimeable number, because it can be changed into a prime (144110141304443) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 40930248 + ... + 44311459.
It is an arithmetic number, because the mean of its divisors is an integer number (27020683777212).
Almost surely, 2144110141304442 is an apocalyptic number.
144110141304442 is a deficient number, since it is larger than the sum of its proper divisors (72055328913254).
144110141304442 is an equidigital number, since it uses as much as digits as its factorization.
144110141304442 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 86087012.
The product of its (nonzero) digits is 24576, while the sum is 34.
Adding to 144110141304442 its reverse (244403141011441), we get a palindrome (388513282315883).
The spelling of 144110141304442 in words is "one hundred forty-four trillion, one hundred ten billion, one hundred forty-one million, three hundred four thousand, four hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •