Base | Representation |
---|---|
bin | 100000110100010100111111… |
… | …101011101100110000101101 |
3 | 200221001010211220101221020012 |
4 | 200310110333223230300231 |
5 | 122404224343231332341 |
6 | 1230545511411503005 |
7 | 42254514205662434 |
oct | 4064247753546055 |
9 | 627033756357205 |
10 | 144333444402221 |
11 | 41a97519666548 |
12 | 142309565b7a65 |
13 | 626c77c1a1139 |
14 | 278dac142211b |
15 | 11a469dd580eb |
hex | 83453faecc2d |
144333444402221 has 8 divisors (see below), whose sum is σ = 145257998307840. Its totient is φ = 143411793335568.
The previous prime is 144333444402197. The next prime is 144333444402227. The reversal of 144333444402221 is 122204444333441.
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 144333444402221 - 222 = 144333440207917 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 (144333444402227) 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, 725609981 + ... + 725808866.
It is an arithmetic number, because the mean of its divisors is an integer number (18157249788480).
Almost surely, 2144333444402221 is an apocalyptic number.
It is an amenable number.
144333444402221 is a deficient number, since it is larger than the sum of its proper divisors (924553905619).
144333444402221 is a wasteful number, since it uses less digits than its factorization.
144333444402221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1451419483.
The product of its (nonzero) digits is 884736, while the sum is 41.
Adding to 144333444402221 its reverse (122204444333441), we get a palindrome (266537888735662).
The spelling of 144333444402221 in words is "one hundred forty-four trillion, three hundred thirty-three billion, four hundred forty-four million, four hundred two thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •