Base | Representation |
---|---|
bin | 1100110101011001001001… |
… | …0010111101101100111101 |
3 | 1211222001001021002122011220 |
4 | 3031112102102331230331 |
5 | 3322200143013342341 |
6 | 50002410415303553 |
7 | 2654342123003202 |
oct | 315262222755475 |
9 | 54861037078156 |
10 | 14111422012221 |
11 | 4550690929606 |
12 | 16baa7a81abb9 |
13 | 7b4916c388b1 |
14 | 36add4453ca9 |
15 | 19710cc87a66 |
hex | cd5924bdb3d |
14111422012221 has 8 divisors (see below), whose sum is σ = 18853549574304. Its totient is φ = 9388454562480.
The previous prime is 14111422012213. The next prime is 14111422012267. The reversal of 14111422012221 is 12221022411141.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14111422012221 - 23 = 14111422012213 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 14111422012191 and 14111422012200.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14111422012021) 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, 4790026366 + ... + 4790029311.
It is an arithmetic number, because the mean of its divisors is an integer number (2356693696788).
Almost surely, 214111422012221 is an apocalyptic number.
It is an amenable number.
14111422012221 is a deficient number, since it is larger than the sum of its proper divisors (4742127562083).
14111422012221 is an equidigital number, since it uses as much as digits as its factorization.
14111422012221 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9580056171.
The product of its (nonzero) digits is 512, while the sum is 24.
Adding to 14111422012221 its reverse (12221022411141), we get a palindrome (26332444423362).
The spelling of 14111422012221 in words is "fourteen trillion, one hundred eleven billion, four hundred twenty-two million, twelve thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •