Base | Representation |
---|---|
bin | 10010001011111… |
… | …001000010011001 |
3 | 210021010001020212 |
4 | 102023321002121 |
5 | 1111101411342 |
6 | 50135300505 |
7 | 10363240031 |
oct | 2213710231 |
9 | 707101225 |
10 | 305107097 |
11 | 147252529 |
12 | 8621a735 |
13 | 4b298559 |
14 | 2c7428c1 |
15 | 1bbbc182 |
hex | 122f9099 |
305107097 has 2 divisors, whose sum is σ = 305107098. Its totient is φ = 305107096.
The previous prime is 305107091. The next prime is 305107129. The reversal of 305107097 is 790701503.
It is an a-pointer prime, because the next prime (305107129) can be obtained adding 305107097 to its sum of digits (32).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 256512256 + 48594841 = 16016^2 + 6971^2 .
It is a cyclic number.
It is not a de Polignac number, because 305107097 - 210 = 305106073 is a prime.
It is equal to p16513934 and since 305107097 and 16513934 have the same sum of digits, it is a Honaker prime.
It is not a weakly prime, because it can be changed into another prime (305107091) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 152553548 + 152553549.
It is an arithmetic number, because the mean of its divisors is an integer number (152553549).
Almost surely, 2305107097 is an apocalyptic number.
It is an amenable number.
305107097 is a deficient number, since it is larger than the sum of its proper divisors (1).
305107097 is an equidigital number, since it uses as much as digits as its factorization.
305107097 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 6615, while the sum is 32.
The square root of 305107097 is about 17467.3151056480. The cubic root of 305107097 is about 673.2103277958.
The spelling of 305107097 in words is "three hundred five million, one hundred seven thousand, ninety-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •