Base | Representation |
---|---|
bin | 10010001111010… |
… | …100100001110101 |
3 | 210022210201111111 |
4 | 102033110201311 |
5 | 1111314144013 |
6 | 50210435021 |
7 | 10404003106 |
oct | 2217244165 |
9 | 708721444 |
10 | 306006133 |
11 | 147806a34 |
12 | 86592a71 |
13 | 4b521824 |
14 | 2c8d83ad |
15 | 1bce873d |
hex | 123d4875 |
306006133 has 2 divisors, whose sum is σ = 306006134. Its totient is φ = 306006132.
The previous prime is 306006101. The next prime is 306006139. The reversal of 306006133 is 331600603.
It is a happy number.
It is the 7142-nd star number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 182196004 + 123810129 = 13498^2 + 11127^2 .
It is an emirp because it is prime and its reverse (331600603) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 306006133 - 25 = 306006101 is a prime.
It is a super-2 number, since 2×3060061332 = 187279506867227378, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (306006139) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 153003066 + 153003067.
It is an arithmetic number, because the mean of its divisors is an integer number (153003067).
Almost surely, 2306006133 is an apocalyptic number.
It is an amenable number.
306006133 is a deficient number, since it is larger than the sum of its proper divisors (1).
306006133 is an equidigital number, since it uses as much as digits as its factorization.
306006133 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 972, while the sum is 22.
The square root of 306006133 is about 17493.0309837947. The cubic root of 306006133 is about 673.8709120360.
Adding to 306006133 its reverse (331600603), we get a palindrome (637606736).
The spelling of 306006133 in words is "three hundred six million, six thousand, one hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.088 sec. • engine limits •