Base | Representation |
---|---|
bin | 1100110101111011001001… |
… | …1111011111111001001101 |
3 | 1211222220121112222022212210 |
4 | 3031132302133133321031 |
5 | 3322322342314303001 |
6 | 50010520405021033 |
7 | 2655114305335134 |
oct | 315366237377115 |
9 | 54886545868783 |
10 | 14120552103501 |
11 | 45545465a4298 |
12 | 17007a83b4779 |
13 | 7b574063707c |
14 | 36b61cc5091b |
15 | 1974945aedd6 |
hex | cd7b27dfe4d |
14120552103501 has 8 divisors (see below), whose sum is σ = 18872336941920. Its totient is φ = 9391234333712.
The previous prime is 14120552103487. The next prime is 14120552103503. The reversal of 14120552103501 is 10530125502141.
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 14120552103501 - 215 = 14120552070733 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14120552103503) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5616765690 + ... + 5616768203.
It is an arithmetic number, because the mean of its divisors is an integer number (2359042117740).
Almost surely, 214120552103501 is an apocalyptic number.
It is an amenable number.
14120552103501 is a deficient number, since it is larger than the sum of its proper divisors (4751784838419).
14120552103501 is a wasteful number, since it uses less digits than its factorization.
14120552103501 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11233534315.
The product of its (nonzero) digits is 6000, while the sum is 30.
Adding to 14120552103501 its reverse (10530125502141), we get a palindrome (24650677605642).
The spelling of 14120552103501 in words is "fourteen trillion, one hundred twenty billion, five hundred fifty-two million, one hundred three thousand, five hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •