Base | Representation |
---|---|
bin | 10101000001000111000… |
… | …111011000111110110000 |
3 | 12010001222220021020101222 |
4 | 111001013013120332300 |
5 | 142130412321143440 |
6 | 3023300411044212 |
7 | 206230103361122 |
oct | 25010707307660 |
9 | 5101886236358 |
10 | 1444302131120 |
11 | 50758599a0a2 |
12 | 1b3ab9a40668 |
13 | a6274073944 |
14 | 4dc942d7212 |
15 | 2788269c2b5 |
hex | 150471d8fb0 |
1444302131120 has 40 divisors (see below), whose sum is σ = 3359162124864. Its totient is φ = 577521339392.
The previous prime is 1444302131099. The next prime is 1444302131131. The reversal of 1444302131120 is 211312034441.
It is a tau number, because it is divible by the number of its divisors (40).
It is a self number, because there is not a number n which added to its sum of digits gives 1444302131120.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2884184 + ... + 3347703.
Almost surely, 21444302131120 is an apocalyptic number.
1444302131120 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1444302131120 is an abundant number, since it is smaller than the sum of its proper divisors (1914859993744).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1444302131120 is a wasteful number, since it uses less digits than its factorization.
1444302131120 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6234797 (or 6234791 counting only the distinct ones).
The product of its (nonzero) digits is 2304, while the sum is 26.
Adding to 1444302131120 its reverse (211312034441), we get a palindrome (1655614165561).
The spelling of 1444302131120 in words is "one trillion, four hundred forty-four billion, three hundred two million, one hundred thirty-one thousand, one hundred twenty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •