Base | Representation |
---|---|
bin | 11010010010101011… |
… | …10011100110010001 |
3 | 1100102201112022220212 |
4 | 31021111303212101 |
5 | 212402012330100 |
6 | 10252353013505 |
7 | 1006535352362 |
oct | 151125634621 |
9 | 40381468825 |
10 | 14115355025 |
11 | 5a93828172 |
12 | 289b254295 |
13 | 143c49a7a5 |
14 | 97c943b69 |
15 | 57931c635 |
hex | 349573991 |
14115355025 has 6 divisors (see below), whose sum is σ = 17503040262. Its totient is φ = 11292284000.
The previous prime is 14115355019. The next prime is 14115355109. The reversal of 14115355025 is 52055351141.
14115355025 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 3 ways, for example, as 14161 + 14115340864 = 119^2 + 118808^2 .
It is not a de Polignac number, because 14115355025 - 212 = 14115350929 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 14115354982 and 14115355000.
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 5 ways as a sum of consecutive naturals, for example, 282307076 + ... + 282307125.
It is an arithmetic number, because the mean of its divisors is an integer number (2917173377).
Almost surely, 214115355025 is an apocalyptic number.
It is an amenable number.
14115355025 is a deficient number, since it is larger than the sum of its proper divisors (3387685237).
14115355025 is an equidigital number, since it uses as much as digits as its factorization.
14115355025 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 564614211 (or 564614206 counting only the distinct ones).
The product of its (nonzero) digits is 15000, while the sum is 32.
The spelling of 14115355025 in words is "fourteen billion, one hundred fifteen million, three hundred fifty-five thousand, twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •