Base | Representation |
---|---|
bin | 11010011111110000… |
… | …01100111110000101 |
3 | 1100201100220122202101 |
4 | 31033320030332011 |
5 | 213113102111031 |
6 | 10311311512101 |
7 | 1012336542442 |
oct | 151770147605 |
9 | 40640818671 |
10 | 14225035141 |
11 | 603a730499 |
12 | 290bb28631 |
13 | 1459120375 |
14 | 98d3349c9 |
15 | 583c85361 |
hex | 34fe0cf85 |
14225035141 has 8 divisors (see below), whose sum is σ = 15070921560. Its totient is φ = 13380162048.
The previous prime is 14225035109. The next prime is 14225035163. The reversal of 14225035141 is 14153052241.
It can be written as a sum of positive squares in 4 ways, for example, as 195580225 + 14029454916 = 13985^2 + 118446^2 .
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 14225035141 - 25 = 14225035109 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14225035241) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 224326 + ... + 280663.
It is an arithmetic number, because the mean of its divisors is an integer number (1883865195).
Almost surely, 214225035141 is an apocalyptic number.
It is an amenable number.
14225035141 is a deficient number, since it is larger than the sum of its proper divisors (845886419).
14225035141 is a wasteful number, since it uses less digits than its factorization.
14225035141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 506663.
The product of its (nonzero) digits is 4800, while the sum is 28.
Adding to 14225035141 its reverse (14153052241), we get a palindrome (28378087382).
The spelling of 14225035141 in words is "fourteen billion, two hundred twenty-five million, thirty-five thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •