Base | Representation |
---|---|
bin | 10010011100100… |
… | …100111011110001 |
3 | 210120100021101201 |
4 | 102130210323301 |
5 | 1113211344301 |
6 | 50413131201 |
7 | 10445355361 |
oct | 2234447361 |
9 | 716307351 |
10 | 309481201 |
11 | 14976a897 |
12 | 87789b01 |
13 | 4c16a493 |
14 | 2d1609a1 |
15 | 1c283201 |
hex | 12724ef1 |
309481201 has 2 divisors, whose sum is σ = 309481202. Its totient is φ = 309481200.
The previous prime is 309481147. The next prime is 309481217. The reversal of 309481201 is 102184903.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 296528400 + 12952801 = 17220^2 + 3599^2 .
It is an emirp because it is prime and its reverse (102184903) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 309481201 - 211 = 309479153 is a prime.
It is a super-2 number, since 2×3094812012 = 191557227544804802, which contains 22 as substring.
It is a Chen prime.
It is a self number, because there is not a number n which added to its sum of digits gives 309481201.
It is not a weakly prime, because it can be changed into another prime (309481231) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 154740600 + 154740601.
It is an arithmetic number, because the mean of its divisors is an integer number (154740601).
Almost surely, 2309481201 is an apocalyptic number.
It is an amenable number.
309481201 is a deficient number, since it is larger than the sum of its proper divisors (1).
309481201 is an equidigital number, since it uses as much as digits as its factorization.
309481201 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1728, while the sum is 28.
The square root of 309481201 is about 17592.0777908694. The cubic root of 309481201 is about 676.4121882218.
The spelling of 309481201 in words is "three hundred nine million, four hundred eighty-one thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •