Base | Representation |
---|---|
bin | 1000010001011110100… |
… | …01011001010110010001 |
3 | 1000011201122002110221012 |
4 | 10020233101121112101 |
5 | 14124131244242321 |
6 | 334330534140305 |
7 | 26352152021600 |
oct | 4105721312621 |
9 | 1004648073835 |
10 | 284260930961 |
11 | aa610980827 |
12 | 471124b1695 |
13 | 20a621445c7 |
14 | da88ad3a37 |
15 | 75daa5b05b |
hex | 422f459591 |
284260930961 has 48 divisors (see below), whose sum is σ = 353636796240. Its totient is φ = 227029340160.
The previous prime is 284260930949. The next prime is 284260930973. The reversal of 284260930961 is 169039062482.
It is an interprime number because it is at equal distance from previous prime (284260930949) and next prime (284260930973).
It can be written as a sum of positive squares in 8 ways, for example, as 2665140625 + 281595790336 = 51625^2 + 530656^2 .
It is not a de Polignac number, because 284260930961 - 222 = 284256736657 is a prime.
It is not an unprimeable number, because it can be changed into a prime (284260930901) 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 47 ways as a sum of consecutive naturals, for example, 34522901 + ... + 34531133.
It is an arithmetic number, because the mean of its divisors is an integer number (7367433255).
Almost surely, 2284260930961 is an apocalyptic number.
It is an amenable number.
284260930961 is a deficient number, since it is larger than the sum of its proper divisors (69375865279).
284260930961 is a wasteful number, since it uses less digits than its factorization.
284260930961 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8674 (or 8667 counting only the distinct ones).
The product of its (nonzero) digits is 1119744, while the sum is 50.
The spelling of 284260930961 in words is "two hundred eighty-four billion, two hundred sixty million, nine hundred thirty thousand, nine hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •