Base | Representation |
---|---|
bin | 11010010011011111… |
… | …01100101100110001 |
3 | 1100110012022011121022 |
4 | 31021233230230301 |
5 | 212410232030023 |
6 | 10253154305225 |
7 | 1006650142103 |
oct | 151157545461 |
9 | 40405264538 |
10 | 14122142513 |
11 | 5a97643766 |
12 | 28a1588215 |
13 | 1440a0605b |
14 | 97d7cd573 |
15 | 579c0d7c8 |
hex | 349becb31 |
14122142513 has 8 divisors (see below), whose sum is σ = 14389472616. Its totient is φ = 13855968000.
The previous prime is 14122142501. The next prime is 14122142519. The reversal of 14122142513 is 31524122141.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 1731558544 + 12390583969 = 41612^2 + 111313^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 14122142513 - 24 = 14122142497 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14122142519) 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, 264206 + ... + 313127.
It is an arithmetic number, because the mean of its divisors is an integer number (1798684077).
Almost surely, 214122142513 is an apocalyptic number.
It is an amenable number.
14122142513 is a deficient number, since it is larger than the sum of its proper divisors (267330103).
14122142513 is an equidigital number, since it uses as much as digits as its factorization.
14122142513 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 577795.
The product of its digits is 1920, while the sum is 26.
Adding to 14122142513 its reverse (31524122141), we get a palindrome (45646264654).
The spelling of 14122142513 in words is "fourteen billion, one hundred twenty-two million, one hundred forty-two thousand, five hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •