Base | Representation |
---|---|
bin | 100110110111110… |
… | …0001010001000101 |
3 | 10100220021102212222 |
4 | 1031233201101011 |
5 | 10132400141121 |
6 | 333231422125 |
7 | 44215250444 |
oct | 11557412105 |
9 | 3326242788 |
10 | 1304302661 |
11 | 60a276992 |
12 | 304984945 |
13 | 17a2b352c |
14 | c5320d5b |
15 | 797900ab |
hex | 4dbe1445 |
1304302661 has 4 divisors (see below), whose sum is σ = 1304457024. Its totient is φ = 1304148300.
The previous prime is 1304302639. The next prime is 1304302717. The reversal of 1304302661 is 1662034031.
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 1304302661 - 210 = 1304301637 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 1304302661.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1304302621) 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, 63725 + ... + 81666.
It is an arithmetic number, because the mean of its divisors is an integer number (326114256).
Almost surely, 21304302661 is an apocalyptic number.
It is an amenable number.
1304302661 is a deficient number, since it is larger than the sum of its proper divisors (154363).
1304302661 is an equidigital number, since it uses as much as digits as its factorization.
1304302661 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 154362.
The product of its (nonzero) digits is 2592, while the sum is 26.
The square root of 1304302661 is about 36115.1306380027. The cubic root of 1304302661 is about 1092.5956323870.
Adding to 1304302661 its reverse (1662034031), we get a palindrome (2966336692).
The spelling of 1304302661 in words is "one billion, three hundred four million, three hundred two thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •