Base | Representation |
---|---|
bin | 10101000001000011100… |
… | …010011101111011011101 |
3 | 12010001211201100101012012 |
4 | 111001003202131323131 |
5 | 142130301440323123 |
6 | 3023250424521005 |
7 | 206225444320601 |
oct | 25010342357335 |
9 | 5101751311165 |
10 | 1444242120413 |
11 | 507555031174 |
12 | 1b3aa1920165 |
13 | a62647c1b51 |
14 | 4dc8a355501 |
15 | 2787c296378 |
hex | 1504389dedd |
1444242120413 has 8 divisors (see below), whose sum is σ = 1478577996000. Its totient is φ = 1410234818128.
The previous prime is 1444242120397. The next prime is 1444242120427. The reversal of 1444242120413 is 3140212424441.
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 1444242120413 - 24 = 1444242120397 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 1444242120413.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1444242120613) 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, 82134431 + ... + 82152012.
It is an arithmetic number, because the mean of its divisors is an integer number (184822249500).
Almost surely, 21444242120413 is an apocalyptic number.
It is an amenable number.
1444242120413 is a deficient number, since it is larger than the sum of its proper divisors (34335875587).
1444242120413 is a wasteful number, since it uses less digits than its factorization.
1444242120413 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 164286651.
The product of its (nonzero) digits is 24576, while the sum is 32.
Adding to 1444242120413 its reverse (3140212424441), we get a palindrome (4584454544854).
The spelling of 1444242120413 in words is "one trillion, four hundred forty-four billion, two hundred forty-two million, one hundred twenty thousand, four hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •