Base | Representation |
---|---|
bin | 100000110000111011101101… |
… | …110111111011010000000011 |
3 | 200220012211122202212100000102 |
4 | 200300323231313323100003 |
5 | 122341414043233012403 |
6 | 1230250405254513015 |
7 | 42231614615145662 |
oct | 4060735567732003 |
9 | 626184582770012 |
10 | 144100143641603 |
11 | 41a07589447a86 |
12 | 141b36a666576b |
13 | 625377b9cc5a6 |
14 | 27826ac79cdd9 |
15 | 119d597106b88 |
hex | 830eeddfb403 |
144100143641603 has 4 divisors (see below), whose sum is σ = 144102886316928. Its totient is φ = 144097400966280.
The previous prime is 144100143641599. The next prime is 144100143641659. The reversal of 144100143641603 is 306146341001441.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 144100143641603 - 22 = 144100143641599 is a prime.
It is a super-2 number, since 2×1441001436416032 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (144100143641203) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1371258851 + ... + 1371363932.
It is an arithmetic number, because the mean of its divisors is an integer number (36025721579232).
Almost surely, 2144100143641603 is an apocalyptic number.
144100143641603 is a deficient number, since it is larger than the sum of its proper divisors (2742675325).
144100143641603 is an equidigital number, since it uses as much as digits as its factorization.
144100143641603 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2742675324.
The product of its (nonzero) digits is 82944, while the sum is 38.
The spelling of 144100143641603 in words is "one hundred forty-four trillion, one hundred billion, one hundred forty-three million, six hundred forty-one thousand, six hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •