Base | Representation |
---|---|
bin | 1100110001010110111110… |
… | …0110101101101100001101 |
3 | 1211201102011112002120102121 |
4 | 3030111233212231230031 |
5 | 3320031230322311341 |
6 | 45510505555452541 |
7 | 2646336556650646 |
oct | 314255746555415 |
9 | 54642145076377 |
10 | 14042120510221 |
11 | 4524258a50411 |
12 | 16a95598b7151 |
13 | 7ab221425a8b |
14 | 3678dc5046cd |
15 | 195403b4e4d1 |
hex | cc56f9adb0d |
14042120510221 has 8 divisors (see below), whose sum is σ = 14049796348224. Its totient is φ = 14034445983360.
The previous prime is 14042120510207. The next prime is 14042120510227. The reversal of 14042120510221 is 12201502124041.
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 14042120510221 - 227 = 14041986292493 is a prime.
It is a super-2 number, since 2×140421205102212 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14042120510227) 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, 21493501 + ... + 22137181.
It is an arithmetic number, because the mean of its divisors is an integer number (1756224543528).
Almost surely, 214042120510221 is an apocalyptic number.
It is an amenable number.
14042120510221 is a deficient number, since it is larger than the sum of its proper divisors (7675838003).
14042120510221 is an equidigital number, since it uses as much as digits as its factorization.
14042120510221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 655571.
The product of its (nonzero) digits is 1280, while the sum is 25.
Adding to 14042120510221 its reverse (12201502124041), we get a palindrome (26243622634262).
The spelling of 14042120510221 in words is "fourteen trillion, forty-two billion, one hundred twenty million, five hundred ten thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •