Base | Representation |
---|---|
bin | 1100110000011001010000… |
… | …0110111010000100011101 |
3 | 1211122211101220111220102210 |
4 | 3030012110012322010131 |
5 | 3314243313040411000 |
6 | 45455130005511033 |
7 | 2645212164650115 |
oct | 314062406720435 |
9 | 54584356456383 |
10 | 14025553060125 |
11 | 45182270699a2 |
12 | 16a62b5412479 |
13 | 7a97b0c2c779 |
14 | 366baa060045 |
15 | 194c8441a350 |
hex | cc1941ba11d |
14025553060125 has 32 divisors (see below), whose sum is σ = 23969291134464. Its totient is φ = 7278124824000.
The previous prime is 14025553060111. The next prime is 14025553060151. The reversal of 14025553060125 is 52106035552041.
It is not a de Polignac number, because 14025553060125 - 24 = 14025553060109 is a prime.
It is a super-2 number, since 2×140255530601252 (a number of 27 digits) contains 22 as substring.
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 31 ways as a sum of consecutive naturals, for example, 505411461 + ... + 505439210.
It is an arithmetic number, because the mean of its divisors is an integer number (749040347952).
Almost surely, 214025553060125 is an apocalyptic number.
14025553060125 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14025553060125 is a deficient number, since it is larger than the sum of its proper divisors (9943738074339).
14025553060125 is a wasteful number, since it uses less digits than its factorization.
14025553060125 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1010850726 (or 1010850716 counting only the distinct ones).
The product of its (nonzero) digits is 180000, while the sum is 39.
The spelling of 14025553060125 in words is "fourteen trillion, twenty-five billion, five hundred fifty-three million, sixty thousand, one hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •