Base | Representation |
---|---|
bin | 1101000111010110101110… |
… | …1000111111110101100101 |
3 | 1220001112120100221122112210 |
4 | 3101311223220333311211 |
5 | 3342224140321401041 |
6 | 50400243415034033 |
7 | 3015545214110151 |
oct | 321655350776545 |
9 | 56045510848483 |
10 | 14420011122021 |
11 | 465a54639315a |
12 | 174a84066b919 |
13 | 807a5536239b |
14 | 37bd0a1b0061 |
15 | 1a016e50d016 |
hex | d1d6ba3fd65 |
14420011122021 has 8 divisors (see below), whose sum is σ = 19226714230720. Its totient is φ = 9613324380672.
The previous prime is 14420011122017. The next prime is 14420011122037. The reversal of 14420011122021 is 12022111002441.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14420011122021 - 22 = 14420011122017 is a prime.
It is a super-2 number, since 2×144200111220212 (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 (14420011122221) 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, 1862620 + ... + 5684133.
It is an arithmetic number, because the mean of its divisors is an integer number (2403339278840).
Almost surely, 214420011122021 is an apocalyptic number.
It is an amenable number.
14420011122021 is a deficient number, since it is larger than the sum of its proper divisors (4806703108699).
14420011122021 is an equidigital number, since it uses as much as digits as its factorization.
14420011122021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8183675.
The product of its (nonzero) digits is 256, while the sum is 21.
Adding to 14420011122021 its reverse (12022111002441), we get a palindrome (26442122124462).
The spelling of 14420011122021 in words is "fourteen trillion, four hundred twenty billion, eleven million, one hundred twenty-two thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •