Base | Representation |
---|---|
bin | 1000110010110000110… |
… | …10010011011111100001 |
3 | 1001212212000210002222200 |
4 | 10121120122103133201 |
5 | 14422231014020223 |
6 | 350444055523413 |
7 | 30554042065221 |
oct | 4313032233741 |
9 | 1055760702880 |
10 | 302131001313 |
11 | 10715108a109 |
12 | 4a67b089569 |
13 | 2264c48242b |
14 | 108a217c081 |
15 | 7cd47eba43 |
hex | 46586937e1 |
302131001313 has 12 divisors (see below), whose sum is σ = 438109548708. Its totient is φ = 200636928000.
The previous prime is 302131001303. The next prime is 302131001357. The reversal of 302131001313 is 313100131203.
It is a happy number.
It can be written as a sum of positive squares in 2 ways, for example, as 186362299809 + 115768701504 = 431697^2 + 340248^2 .
It is not a de Polignac number, because 302131001313 - 210 = 302131000289 is a prime.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (302131001303) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 65309188 + ... + 65313813.
It is an arithmetic number, because the mean of its divisors is an integer number (36509129059).
Almost surely, 2302131001313 is an apocalyptic number.
It is an amenable number.
302131001313 is a deficient number, since it is larger than the sum of its proper divisors (135978547395).
302131001313 is a wasteful number, since it uses less digits than its factorization.
302131001313 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 130623264 (or 130623261 counting only the distinct ones).
The product of its (nonzero) digits is 162, while the sum is 18.
Adding to 302131001313 its reverse (313100131203), we get a palindrome (615231132516).
The spelling of 302131001313 in words is "three hundred two billion, one hundred thirty-one million, one thousand, three hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •