Base | Representation |
---|---|
bin | 1100110010010111111001… |
… | …0110111000000010101011 |
3 | 1211210002011001202222100010 |
4 | 3030211332112320002223 |
5 | 3320322423224320424 |
6 | 45522511144543003 |
7 | 2650524463131636 |
oct | 314457626700253 |
9 | 54702131688303 |
10 | 14059547885739 |
11 | 45306912825a4 |
12 | 16b0a02181a63 |
13 | 7aca6ab23cb5 |
14 | 3686b2c72c1d |
15 | 195ac3ae6229 |
hex | cc97e5b80ab |
14059547885739 has 8 divisors (see below), whose sum is σ = 18746460418192. Its totient is φ = 9372833638560.
The previous prime is 14059547885729. The next prime is 14059547885767. The reversal of 14059547885739 is 93758874595041.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 14059547885739 - 27 = 14059547885611 is a prime.
It is a super-2 number, since 2×140595478857392 (a number of 27 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (14059547885729) 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 7 ways as a sum of consecutive naturals, for example, 49405792 + ... + 49689549.
It is an arithmetic number, because the mean of its divisors is an integer number (2343307552274).
Almost surely, 214059547885739 is an apocalyptic number.
14059547885739 is a deficient number, since it is larger than the sum of its proper divisors (4686912532453).
14059547885739 is an equidigital number, since it uses as much as digits as its factorization.
14059547885739 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 99142637.
The product of its (nonzero) digits is 1524096000, while the sum is 75.
The spelling of 14059547885739 in words is "fourteen trillion, fifty-nine billion, five hundred forty-seven million, eight hundred eighty-five thousand, seven hundred thirty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •