Base | Representation |
---|---|
bin | 1000110010101111100… |
… | …01011111001000111001 |
3 | 1001212211021122111001222 |
4 | 10121113301133020321 |
5 | 14422220244113423 |
6 | 350443034321425 |
7 | 30553552121261 |
oct | 4312761371071 |
9 | 1055737574058 |
10 | 302120301113 |
11 | 107146040974 |
12 | 4a677589275 |
13 | 2264a1a6c57 |
14 | 108a09947a1 |
15 | 7cd38d63c8 |
hex | 4657c5f239 |
302120301113 has 2 divisors, whose sum is σ = 302120301114. Its totient is φ = 302120301112.
The previous prime is 302120301103. The next prime is 302120301137. The reversal of 302120301113 is 311103021203.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 301365865024 + 754436089 = 548968^2 + 27467^2 .
It is a cyclic number.
It is not a de Polignac number, because 302120301113 - 24 = 302120301097 is a prime.
It is a Sophie Germain prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 302120301091 and 302120301100.
It is not a weakly prime, because it can be changed into another prime (302120301103) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 151060150556 + 151060150557.
It is an arithmetic number, because the mean of its divisors is an integer number (151060150557).
Almost surely, 2302120301113 is an apocalyptic number.
It is an amenable number.
302120301113 is a deficient number, since it is larger than the sum of its proper divisors (1).
302120301113 is an equidigital number, since it uses as much as digits as its factorization.
302120301113 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 108, while the sum is 17.
Adding to 302120301113 its reverse (311103021203), we get a palindrome (613223322316).
The spelling of 302120301113 in words is "three hundred two billion, one hundred twenty million, three hundred one thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •