Base | Representation |
---|---|
bin | 1000110010100001010… |
… | …10011110100001110001 |
3 | 1001212111222012112101101 |
4 | 10121100222132201301 |
5 | 14421444230214324 |
6 | 350423134004401 |
7 | 30550603225033 |
oct | 4312052364161 |
9 | 1055458175341 |
10 | 302001023089 |
11 | 107094782597 |
12 | 4a643646701 |
13 | 2262b57383c |
14 | 1088cbc5c53 |
15 | 7cc81c4944 |
hex | 4650a9e871 |
302001023089 has 2 divisors, whose sum is σ = 302001023090. Its totient is φ = 302001023088.
The previous prime is 302001023063. The next prime is 302001023117. The reversal of 302001023089 is 980320100203.
It is an a-pointer prime, because the next prime (302001023117) can be obtained adding 302001023089 to its sum of digits (28).
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 275826636864 + 26174386225 = 525192^2 + 161785^2 .
It is a cyclic number.
It is not a de Polignac number, because 302001023089 - 211 = 302001021041 is a prime.
It is a super-2 number, since 2×3020010230892 (a number of 24 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (302001023689) 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, 151000511544 + 151000511545.
It is an arithmetic number, because the mean of its divisors is an integer number (151000511545).
Almost surely, 2302001023089 is an apocalyptic number.
It is an amenable number.
302001023089 is a deficient number, since it is larger than the sum of its proper divisors (1).
302001023089 is an equidigital number, since it uses as much as digits as its factorization.
302001023089 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2592, while the sum is 28.
The spelling of 302001023089 in words is "three hundred two billion, one million, twenty-three thousand, eighty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •