Base | Representation |
---|---|
bin | 1101000001110001111111… |
… | …0110111101011011000101 |
3 | 1212201101101122022122000000 |
4 | 3100130133312331123011 |
5 | 3334142031102330341 |
6 | 50244245251111513 |
7 | 3005615164511421 |
oct | 320343766753305 |
9 | 55641348278000 |
10 | 14324250433221 |
11 | 4622975a34333 |
12 | 17341765a2599 |
13 | 7cba03c13811 |
14 | 377424199b81 |
15 | 19c91756a8b6 |
hex | d071fdbd6c5 |
14324250433221 has 28 divisors (see below), whose sum is σ = 21492332528460. Its totient is φ = 9542483095680.
The previous prime is 14324250433193. The next prime is 14324250433307. The reversal of 14324250433221 is 12233405242341.
14324250433221 is a `hidden beast` number, since 1 + 4 + 3 + 2 + 425 + 0 + 4 + 3 + 3 + 221 = 666.
It can be written as a sum of positive squares in 2 ways, for example, as 8664109832196 + 5660140601025 = 2943486^2 + 2379105^2 .
It is not a de Polignac number, because 14324250433221 - 214 = 14324250416837 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14324250433721) by changing a digit.
It is a polite number, since it can be written in 27 ways as a sum of consecutive naturals, for example, 6226486 + ... + 8210823.
Almost surely, 214324250433221 is an apocalyptic number.
It is an amenable number.
14324250433221 is a deficient number, since it is larger than the sum of its proper divisors (7168082095239).
14324250433221 is an equidigital number, since it uses as much as digits as its factorization.
14324250433221 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14438688 (or 14438673 counting only the distinct ones).
The product of its (nonzero) digits is 138240, while the sum is 36.
Adding to 14324250433221 its reverse (12233405242341), we get a palindrome (26557655675562).
The spelling of 14324250433221 in words is "fourteen trillion, three hundred twenty-four billion, two hundred fifty million, four hundred thirty-three thousand, two hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •