Base | Representation |
---|---|
bin | 11010001010111100… |
… | …01011101110001101 |
3 | 1100021012101102011101 |
4 | 31011132023232031 |
5 | 212233403122000 |
6 | 10242113423101 |
7 | 1005116534056 |
oct | 150536135615 |
9 | 40235342141 |
10 | 14050442125 |
11 | 5a60121145 |
12 | 288156aa91 |
13 | 142bbc05a5 |
14 | 97408772d |
15 | 573798e6a |
hex | 34578bb8d |
14050442125 has 8 divisors (see below), whose sum is σ = 17534951928. Its totient is φ = 11240353600.
The previous prime is 14050442113. The next prime is 14050442207. The reversal of 14050442125 is 52124405041.
It can be written as a sum of positive squares in 4 ways, for example, as 251476164 + 13798965961 = 15858^2 + 117469^2 .
It is not a de Polignac number, because 14050442125 - 27 = 14050441997 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14050442093 and 14050442102.
It is a congruent number.
It is an unprimeable number.
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, 56201644 + ... + 56201893.
It is an arithmetic number, because the mean of its divisors is an integer number (2191868991).
Almost surely, 214050442125 is an apocalyptic number.
It is an amenable number.
14050442125 is a deficient number, since it is larger than the sum of its proper divisors (3484509803).
14050442125 is an equidigital number, since it uses as much as digits as its factorization.
14050442125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 112403552 (or 112403542 counting only the distinct ones).
The product of its (nonzero) digits is 6400, while the sum is 28.
Adding to 14050442125 its reverse (52124405041), we get a palindrome (66174847166).
The spelling of 14050442125 in words is "fourteen billion, fifty million, four hundred forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •