Base | Representation |
---|---|
bin | 1011010001100010… |
… | …1110111101000101 |
3 | 21210220200011112201 |
4 | 2310120232331011 |
5 | 22144223221121 |
6 | 1220145514501 |
7 | 134665554031 |
oct | 26430567505 |
9 | 7726604481 |
10 | 3026382661 |
11 | 13133500a5 |
12 | 705642a31 |
13 | 392cc0b93 |
14 | 209d131c1 |
15 | 12aa55e91 |
hex | b462ef45 |
3026382661 has 2 divisors, whose sum is σ = 3026382662. Its totient is φ = 3026382660.
The previous prime is 3026382659. The next prime is 3026382703. The reversal of 3026382661 is 1662836203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 2975702500 + 50680161 = 54550^2 + 7119^2 .
It is a cyclic number.
It is not a de Polignac number, because 3026382661 - 21 = 3026382659 is a prime.
Together with 3026382659, it forms a pair of twin primes.
It is a self number, because there is not a number n which added to its sum of digits gives 3026382661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (3026382631) 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 as a sum of consecutive naturals, namely, 1513191330 + 1513191331.
It is an arithmetic number, because the mean of its divisors is an integer number (1513191331).
Almost surely, 23026382661 is an apocalyptic number.
It is an amenable number.
3026382661 is a deficient number, since it is larger than the sum of its proper divisors (1).
3026382661 is an equidigital number, since it uses as much as digits as its factorization.
3026382661 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 62208, while the sum is 37.
The square root of 3026382661 is about 55012.5682094556. The cubic root of 3026382661 is about 1446.4650572101.
The spelling of 3026382661 in words is "three billion, twenty-six million, three hundred eighty-two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •