Base | Representation |
---|---|
bin | 1100100000010111001101… |
… | …1001100010011010001001 |
3 | 1210200111110221122022120122 |
4 | 3020011303121202122021 |
5 | 3300240224323420443 |
6 | 45124415412233025 |
7 | 2616261643611350 |
oct | 310056331423211 |
9 | 53614427568518 |
10 | 13750126388873 |
11 | 4421439977256 |
12 | 1660a4960b775 |
13 | 789829117c94 |
14 | 35771c75a997 |
15 | 18ca1424c968 |
hex | c8173662689 |
13750126388873 has 4 divisors (see below), whose sum is σ = 15714430158720. Its totient is φ = 11785822619028.
The previous prime is 13750126388813. The next prime is 13750126388881. The reversal of 13750126388873 is 37888362105731.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-13750126388873 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (13750126388813) 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 3 ways as a sum of consecutive naturals, for example, 982151884913 + ... + 982151884926.
It is an arithmetic number, because the mean of its divisors is an integer number (3928607539680).
Almost surely, 213750126388873 is an apocalyptic number.
It is an amenable number.
13750126388873 is a deficient number, since it is larger than the sum of its proper divisors (1964303769847).
13750126388873 is an equidigital number, since it uses as much as digits as its factorization.
13750126388873 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1964303769846.
The product of its (nonzero) digits is 40642560, while the sum is 62.
The spelling of 13750126388873 in words is "thirteen trillion, seven hundred fifty billion, one hundred twenty-six million, three hundred eighty-eight thousand, eight hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •