Base | Representation |
---|---|
bin | 10010010001010… |
… | …100011100010001 |
3 | 210100210100012101 |
4 | 102101110130101 |
5 | 1111432430230 |
6 | 50230000401 |
7 | 10411314442 |
oct | 2221243421 |
9 | 710710171 |
10 | 306530065 |
11 | 148034636 |
12 | 867a6101 |
13 | 4b67614a |
14 | 2c9d32c9 |
15 | 1bd9daca |
hex | 12454711 |
306530065 has 4 divisors (see below), whose sum is σ = 367836084. Its totient is φ = 245224048.
The previous prime is 306530047. The next prime is 306530071. The reversal of 306530065 is 560035603.
It is a Cunningham number, because it is equal to 175082+1.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 110334016 + 196196049 = 10504^2 + 14007^2 .
It is a cyclic number.
It is not a de Polignac number, because 306530065 - 227 = 172312337 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 (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 30653002 + ... + 30653011.
It is an arithmetic number, because the mean of its divisors is an integer number (91959021).
Almost surely, 2306530065 is an apocalyptic number.
It is an amenable number.
306530065 is a deficient number, since it is larger than the sum of its proper divisors (61306019).
306530065 is an equidigital number, since it uses as much as digits as its factorization.
306530065 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 61306018.
The product of its (nonzero) digits is 8100, while the sum is 28.
The square root of 306530065 is about 17508.0000285584. Note that the first 4 decimals coincide. The cubic root of 306530065 is about 674.2552847527.
Adding to 306530065 its reverse (560035603), we get a palindrome (866565668).
The spelling of 306530065 in words is "three hundred six million, five hundred thirty thousand, sixty-five".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •