Base | Representation |
---|---|
bin | 1100110000001001011111… |
… | …1010101111001011001111 |
3 | 1211122102111001001100122100 |
4 | 3030002113322233023033 |
5 | 3314211131413330333 |
6 | 45453150103450143 |
7 | 2645002300431663 |
oct | 314022772571317 |
9 | 54572431040570 |
10 | 14021322011343 |
11 | 4516455816369 |
12 | 16a5514456953 |
13 | 7a92884a25ca |
14 | 3668c81648a3 |
15 | 194ad7c56213 |
hex | cc097eaf2cf |
14021322011343 has 24 divisors (see below), whose sum is σ = 20407998227760. Its totient is φ = 9276022529280.
The previous prime is 14021322011299. The next prime is 14021322011377. The reversal of 14021322011343 is 34311022312041.
14021322011343 is a `hidden beast` number, since 1 + 402 + 1 + 3 + 2 + 201 + 13 + 43 = 666.
It is not a de Polignac number, because 14021322011343 - 217 = 14021321880271 is a prime.
It is a super-2 number, since 2×140213220113432 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14021322011143) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 126202405 + ... + 126313457.
It is an arithmetic number, because the mean of its divisors is an integer number (850333259490).
Almost surely, 214021322011343 is an apocalyptic number.
14021322011343 is a deficient number, since it is larger than the sum of its proper divisors (6386676216417).
14021322011343 is a wasteful number, since it uses less digits than its factorization.
14021322011343 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 218279 (or 218276 counting only the distinct ones).
The product of its (nonzero) digits is 3456, while the sum is 27.
Adding to 14021322011343 its reverse (34311022312041), we get a palindrome (48332344323384).
The spelling of 14021322011343 in words is "fourteen trillion, twenty-one billion, three hundred twenty-two million, eleven thousand, three hundred forty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •