Base | Representation |
---|---|
bin | 11001000010110010000111… |
… | …111000111111100110001101 |
3 | 112102222111211201011112110002 |
4 | 121002302013320333212031 |
5 | 103414033134312001331 |
6 | 1030130421344254045 |
7 | 32125345606002662 |
oct | 3102620770774615 |
9 | 472874751145402 |
10 | 110142421203341 |
11 | 321051583a922a |
12 | 1042a40a011325 |
13 | 495c502664147 |
14 | 1d2acc8d4ba69 |
15 | cb00ccc979cb |
hex | 642c87e3f98d |
110142421203341 has 8 divisors (see below), whose sum is σ = 110315438326368. Its totient is φ = 109969443450000.
The previous prime is 110142421203281. The next prime is 110142421203349. The reversal of 110142421203341 is 143302124241011.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-110142421203341 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (110142421203349) 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, 4240235 + ... + 15435816.
It is an arithmetic number, because the mean of its divisors is an integer number (13789429790796).
Almost surely, 2110142421203341 is an apocalyptic number.
It is an amenable number.
110142421203341 is a deficient number, since it is larger than the sum of its proper divisors (173017123027).
110142421203341 is an equidigital number, since it uses as much as digits as its factorization.
110142421203341 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 19684843.
The product of its (nonzero) digits is 4608, while the sum is 29.
Adding to 110142421203341 its reverse (143302124241011), we get a palindrome (253444545444352).
The spelling of 110142421203341 in words is "one hundred ten trillion, one hundred forty-two billion, four hundred twenty-one million, two hundred three thousand, three hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •