Base | Representation |
---|---|
bin | 1100110101100111000000… |
… | …0110010100111100011111 |
3 | 1211222101122121020200002122 |
4 | 3031121300012110330133 |
5 | 3322230303132212003 |
6 | 50004223550213155 |
7 | 2654533256636153 |
oct | 315316006247437 |
9 | 54871577220078 |
10 | 14115143241503 |
11 | 4552220419207 |
12 | 16bb738ab41bb |
13 | 7b508ab83305 |
14 | 36b26875d063 |
15 | 1972797e4238 |
hex | cd670194f1f |
14115143241503 has 4 divisors (see below), whose sum is σ = 14119024230360. Its totient is φ = 14111262252648.
The previous prime is 14115143241487. The next prime is 14115143241533. The reversal of 14115143241503 is 30514234151141.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 14115143241503 - 24 = 14115143241487 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (14115143241533) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 1940488973 + ... + 1940496246.
It is an arithmetic number, because the mean of its divisors is an integer number (3529756057590).
Almost surely, 214115143241503 is an apocalyptic number.
14115143241503 is a deficient number, since it is larger than the sum of its proper divisors (3880988857).
14115143241503 is an equidigital number, since it uses as much as digits as its factorization.
14115143241503 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3880988856.
The product of its (nonzero) digits is 28800, while the sum is 35.
Adding to 14115143241503 its reverse (30514234151141), we get a palindrome (44629377392644).
The spelling of 14115143241503 in words is "fourteen trillion, one hundred fifteen billion, one hundred forty-three million, two hundred forty-one thousand, five hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •