Base | Representation |
---|---|
bin | 1101000010101101001100… |
… | …1101101110100001010100 |
3 | 1212202220102022200001220211 |
4 | 3100223103031232201110 |
5 | 3334422103433100134 |
6 | 50255434342335204 |
7 | 3010020101304124 |
oct | 320532315564124 |
9 | 55686368601824 |
10 | 14340144425044 |
11 | 4629691754669 |
12 | 173727142a504 |
13 | 800367a315c9 |
14 | 3780d1014c84 |
15 | 19d047ac1764 |
hex | d0ad336e854 |
14340144425044 has 12 divisors (see below), whose sum is σ = 25629194291904. Its totient is φ = 7017517484504.
The previous prime is 14340144425041. The next prime is 14340144425081. The reversal of 14340144425044 is 44052444104341.
It is a super-2 number, since 2×143401444250442 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 14340144424988 and 14340144425006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14340144425041) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 38138681794 + ... + 38138682169.
It is an arithmetic number, because the mean of its divisors is an integer number (2135766190992).
Almost surely, 214340144425044 is an apocalyptic number.
It is an amenable number.
14340144425044 is a deficient number, since it is larger than the sum of its proper divisors (11289049866860).
14340144425044 is a wasteful number, since it uses less digits than its factorization.
14340144425044 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 76277364014 (or 76277364012 counting only the distinct ones).
The product of its (nonzero) digits is 491520, while the sum is 40.
Adding to 14340144425044 its reverse (44052444104341), we get a palindrome (58392588529385).
The spelling of 14340144425044 in words is "fourteen trillion, three hundred forty billion, one hundred forty-four million, four hundred twenty-five thousand, forty-four".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.861 sec. • engine limits •