Base | Representation |
---|---|
bin | 1101001000100001100110… |
… | …1000100100000011101001 |
3 | 1220010110110002202011220010 |
4 | 3102020121220210003221 |
5 | 3343041321142104001 |
6 | 50413410042122133 |
7 | 3020156250524406 |
oct | 322103150440351 |
9 | 56113402664803 |
10 | 14440110113001 |
11 | 466801a784601 |
12 | 175270b7b0349 |
13 | 8099093b9461 |
14 | 37cc956a32ad |
15 | 1a0948cce8d6 |
hex | d2219a240e9 |
14440110113001 has 8 divisors (see below), whose sum is σ = 19663128664704. Its totient is φ = 9421915818320.
The previous prime is 14440110112969. The next prime is 14440110113101. The reversal of 14440110113001 is 10031101104441.
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 14440110113001 - 25 = 14440110112969 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (14440110113101) 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, 51206064090 + ... + 51206064371.
It is an arithmetic number, because the mean of its divisors is an integer number (2457891083088).
Almost surely, 214440110113001 is an apocalyptic number.
It is an amenable number.
14440110113001 is a deficient number, since it is larger than the sum of its proper divisors (5223018551703).
14440110113001 is a wasteful number, since it uses less digits than its factorization.
14440110113001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 102412128511.
The product of its (nonzero) digits is 192, while the sum is 21.
Adding to 14440110113001 its reverse (10031101104441), we get a palindrome (24471211217442).
The spelling of 14440110113001 in words is "fourteen trillion, four hundred forty billion, one hundred ten million, one hundred thirteen thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •