Base | Representation |
---|---|
bin | 11010001001111100… |
… | …11000010111101101 |
3 | 1100020121200212020000 |
4 | 31010332120113231 |
5 | 212224234332300 |
6 | 10241215014513 |
7 | 1004655632403 |
oct | 150476302755 |
9 | 40217625200 |
10 | 14042105325 |
11 | 5a56447626 |
12 | 287a80a439 |
13 | 142a261a81 |
14 | 972d17473 |
15 | 572b9dc00 |
hex | 344f985ed |
14042105325 has 120 divisors (see below), whose sum is σ = 27572550720. Its totient is φ = 7045056000.
The previous prime is 14042105323. The next prime is 14042105359. The reversal of 14042105325 is 52350124041.
It is not a de Polignac number, because 14042105325 - 21 = 14042105323 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14042105323) 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 119 ways as a sum of consecutive naturals, for example, 5808517 + ... + 5810933.
It is an arithmetic number, because the mean of its divisors is an integer number (229771256).
Almost surely, 214042105325 is an apocalyptic number.
14042105325 is a gapful number since it is divisible by the number (15) formed by its first and last digit.
It is an amenable number.
14042105325 is a deficient number, since it is larger than the sum of its proper divisors (13530445395).
14042105325 is a wasteful number, since it uses less digits than its factorization.
14042105325 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2609 (or 2595 counting only the distinct ones).
The product of its (nonzero) digits is 4800, while the sum is 27.
Adding to 14042105325 its reverse (52350124041), we get a palindrome (66392229366).
The spelling of 14042105325 in words is "fourteen billion, forty-two million, one hundred five thousand, three hundred twenty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •