Base | Representation |
---|---|
bin | 11010010010101011… |
… | …10000011100101101 |
3 | 1100102201111200020002 |
4 | 31021111300130231 |
5 | 212402011422000 |
6 | 10252352434045 |
7 | 1006535266643 |
oct | 151125603455 |
9 | 40381450202 |
10 | 14115342125 |
11 | 5a93819505 |
12 | 289b248925 |
13 | 143c494961 |
14 | 97c93d193 |
15 | 5793188d5 |
hex | 34957072d |
14115342125 has 16 divisors (see below), whose sum is σ = 17635054320. Its totient is φ = 11280025600.
The previous prime is 14115342113. The next prime is 14115342139. The reversal of 14115342125 is 52124351141.
It is a happy number.
14115342125 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It can be written as a sum of positive squares in 8 ways, for example, as 12537504841 + 1577837284 = 111971^2 + 39722^2 .
It is not a de Polignac number, because 14115342125 - 218 = 14115079981 is a prime.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 55349 + ... + 176901.
It is an arithmetic number, because the mean of its divisors is an integer number (1102190895).
Almost surely, 214115342125 is an apocalyptic number.
It is an amenable number.
14115342125 is a deficient number, since it is larger than the sum of its proper divisors (3519712195).
14115342125 is an equidigital number, since it uses as much as digits as its factorization.
14115342125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 122497 (or 122487 counting only the distinct ones).
The product of its digits is 4800, while the sum is 29.
Adding to 14115342125 its reverse (52124351141), we get a palindrome (66239693266).
The spelling of 14115342125 in words is "fourteen billion, one hundred fifteen million, three hundred forty-two thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •