Base | Representation |
---|---|
bin | 10101000001001001100… |
… | …111101010000010001011 |
3 | 12010002002211022201020222 |
4 | 111001021213222002023 |
5 | 142131004100102021 |
6 | 3023304511340255 |
7 | 206231123441516 |
oct | 25011147520213 |
9 | 5102084281228 |
10 | 1444344144011 |
11 | 5075a7684a9a |
12 | 1b3b0bb2168b |
13 | a627c993742 |
14 | 4dc99b11d7d |
15 | 278861ea6ab |
hex | 150499ea08b |
1444344144011 has 8 divisors (see below), whose sum is σ = 1491937238400. Its totient is φ = 1396813633920.
The previous prime is 1444344143993. The next prime is 1444344144077. The reversal of 1444344144011 is 1104414434441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 1444344144011 - 222 = 1444339949707 is a prime.
It is a super-2 number, since 2×14443441440112 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (1444344144311) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 15599156 + ... + 15691473.
It is an arithmetic number, because the mean of its divisors is an integer number (186492154800).
Almost surely, 21444344144011 is an apocalyptic number.
1444344144011 is a deficient number, since it is larger than the sum of its proper divisors (47593094389).
1444344144011 is a wasteful number, since it uses less digits than its factorization.
1444344144011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 31292149.
The product of its (nonzero) digits is 49152, while the sum is 35.
Adding to 1444344144011 its reverse (1104414434441), we get a palindrome (2548758578452).
The spelling of 1444344144011 in words is "one trillion, four hundred forty-four billion, three hundred forty-four million, one hundred forty-four thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •