Base | Representation |
---|---|
bin | 1101000000011100001010… |
… | …0010110101111110000001 |
3 | 1212122011220220202111101221 |
4 | 3100013002202311332001 |
5 | 3333302334232322431 |
6 | 50225515111355041 |
7 | 3004141213435033 |
oct | 320070242657601 |
9 | 55564826674357 |
10 | 14301210042241 |
11 | 46141222675a1 |
12 | 172b806382a81 |
13 | 7c97a1681b85 |
14 | 37627a195c53 |
15 | 19c01992d111 |
hex | d01c28b5f81 |
14301210042241 has 8 divisors (see below), whose sum is σ = 14925120793920. Its totient is φ = 13677475874832.
The previous prime is 14301210042181. The next prime is 14301210042281. The reversal of 14301210042241 is 14224001210341.
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 14301210042241 - 27 = 14301210042113 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14301210042281) by changing a digit.
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, 43980546 + ... + 44304523.
It is an arithmetic number, because the mean of its divisors is an integer number (1865640099240).
Almost surely, 214301210042241 is an apocalyptic number.
It is an amenable number.
14301210042241 is a deficient number, since it is larger than the sum of its proper divisors (623910751679).
14301210042241 is an equidigital number, since it uses as much as digits as its factorization.
14301210042241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 88292135.
The product of its (nonzero) digits is 1536, while the sum is 25.
Adding to 14301210042241 its reverse (14224001210341), we get a palindrome (28525211252582).
The spelling of 14301210042241 in words is "fourteen trillion, three hundred one billion, two hundred ten million, forty-two thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •