Base | Representation |
---|---|
bin | 100000011011111111000100… |
… | …1001100100100111011001101 |
3 | 1101102020110002011201101112211 |
4 | 1000313332021030210323031 |
5 | 244344200432144404031 |
6 | 2450454441152030421 |
7 | 114045532105121512 |
oct | 10067761114447315 |
9 | 1342213064641484 |
10 | 285321274216141 |
11 | 82a04088a91759 |
12 | 28001211532411 |
13 | c3288b0699917 |
14 | 50658a26b7309 |
15 | 22ebcdb41ebb1 |
hex | 1037f89324ecd |
285321274216141 has 4 divisors (see below), whose sum is σ = 285797603556000. Its totient is φ = 284844944876284.
The previous prime is 285321274216133. The next prime is 285321274216171. The reversal of 285321274216141 is 141612472123582.
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 not a de Polignac number, because 285321274216141 - 23 = 285321274216133 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 (285321274216171) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 238164669031 + ... + 238164670228.
It is an arithmetic number, because the mean of its divisors is an integer number (71449400889000).
Almost surely, 2285321274216141 is an apocalyptic number.
It is an amenable number.
285321274216141 is a deficient number, since it is larger than the sum of its proper divisors (476329339859).
285321274216141 is an equidigital number, since it uses as much as digits as its factorization.
285321274216141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 476329339858.
The product of its digits is 1290240, while the sum is 49.
The spelling of 285321274216141 in words is "two hundred eighty-five trillion, three hundred twenty-one billion, two hundred seventy-four million, two hundred sixteen thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •