Base | Representation |
---|---|
bin | 1101001000100101110100… |
… | …1011011010111011100011 |
3 | 1220010120101002002021022201 |
4 | 3102021131023122323203 |
5 | 3343101131242333011 |
6 | 50414114322514031 |
7 | 3020226320622061 |
oct | 322113513327343 |
9 | 56116332067281 |
10 | 14441243324131 |
11 | 4668551412928 |
12 | 1752987205917 |
13 | 809a5a0c78a0 |
14 | 37cd61da9031 |
15 | 1a09b3525cc1 |
hex | d225d2daee3 |
14441243324131 has 8 divisors (see below), whose sum is σ = 15552144496224. Its totient is φ = 13330347337920.
The previous prime is 14441243324111. The next prime is 14441243324161. The reversal of 14441243324131 is 13142334214441.
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 14441243324131 - 27 = 14441243324003 is a prime.
It is a super-2 number, since 2×144412433241312 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14441243324111) 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, 6013935 + ... + 8065351.
It is an arithmetic number, because the mean of its divisors is an integer number (1944018062028).
Almost surely, 214441243324131 is an apocalyptic number.
14441243324131 is a deficient number, since it is larger than the sum of its proper divisors (1110901172093).
14441243324131 is a wasteful number, since it uses less digits than its factorization.
14441243324131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2592941.
The product of its digits is 110592, while the sum is 37.
Adding to 14441243324131 its reverse (13142334214441), we get a palindrome (27583577538572).
The spelling of 14441243324131 in words is "fourteen trillion, four hundred forty-one billion, two hundred forty-three million, three hundred twenty-four thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •