Base | Representation |
---|---|
bin | 100100011001000011101001… |
… | …0000001110101101011111001 |
3 | 1112222101120011021222001121111 |
4 | 1020302013102001311223321 |
5 | 313424032213133112420 |
6 | 3052445204130240321 |
7 | 124265455151222260 |
oct | 11062072201655371 |
9 | 1488346137861544 |
10 | 320103141300985 |
11 | 92aa3a86213579 |
12 | 2ba9a1724260a1 |
13 | 1097c79ac54063 |
14 | 5909108dbd5d7 |
15 | 270193d5d545a |
hex | 12321d2075af9 |
320103141300985 has 8 divisors (see below), whose sum is σ = 438998593784256. Its totient is φ = 219499296892080.
The previous prime is 320103141300913. The next prime is 320103141300997. The reversal of 320103141300985 is 589003141301023.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 320103141300985 - 211 = 320103141298937 is a prime.
It is a Duffinian number.
It is an unprimeable number.
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, 4572902018551 + ... + 4572902018620.
It is an arithmetic number, because the mean of its divisors is an integer number (54874824223032).
Almost surely, 2320103141300985 is an apocalyptic number.
320103141300985 is a gapful number since it is divisible by the number (35) formed by its first and last digit.
It is an amenable number.
320103141300985 is a deficient number, since it is larger than the sum of its proper divisors (118895452483271).
320103141300985 is an equidigital number, since it uses as much as digits as its factorization.
320103141300985 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9145804037183.
The product of its (nonzero) digits is 77760, while the sum is 40.
The spelling of 320103141300985 in words is "three hundred twenty trillion, one hundred three billion, one hundred forty-one million, three hundred thousand, nine hundred eighty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •