Base | Representation |
---|---|
bin | 10100000101001001011… |
… | …100110100010000001111 |
3 | 11212220210202220011110201 |
4 | 110011021130310100033 |
5 | 140102032144332342 |
6 | 2533531445514331 |
7 | 201460424131465 |
oct | 24051134642017 |
9 | 4786722804421 |
10 | 1379916792847 |
11 | 49224606752a |
12 | 1a352b4129a7 |
13 | a0182c18148 |
14 | 4ab07264835 |
15 | 25d64e59db7 |
hex | 1414973440f |
1379916792847 has 4 divisors (see below), whose sum is σ = 1380883799736. Its totient is φ = 1378949785960.
The previous prime is 1379916792841. The next prime is 1379916792851. The reversal of 1379916792847 is 7482976199731.
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 1379916792847 - 27 = 1379916792719 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1379916792847.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1379916792841) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 483501304 + ... + 483504157.
It is an arithmetic number, because the mean of its divisors is an integer number (345220949934).
Almost surely, 21379916792847 is an apocalyptic number.
1379916792847 is a deficient number, since it is larger than the sum of its proper divisors (967006889).
1379916792847 is an equidigital number, since it uses as much as digits as its factorization.
1379916792847 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 967006888.
The product of its digits is 288054144, while the sum is 73.
The spelling of 1379916792847 in words is "one trillion, three hundred seventy-nine billion, nine hundred sixteen million, seven hundred ninety-two thousand, eight hundred forty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •