Base | Representation |
---|---|
bin | 1000110011000110100… |
… | …01000100100010000001 |
3 | 1001220022201111012201210 |
4 | 10121203101010202001 |
5 | 14423114130130423 |
6 | 350514123320333 |
7 | 30561413131041 |
oct | 4314321044201 |
9 | 1056281435653 |
10 | 302313130113 |
11 | 107234976185 |
12 | 4a7100800a9 |
13 | 2267b120257 |
14 | 108bc42b721 |
15 | 7ce57c5b93 |
hex | 4663444881 |
302313130113 has 8 divisors (see below), whose sum is σ = 403091331328. Its totient is φ = 201538507824.
The previous prime is 302313130073. The next prime is 302313130129. The reversal of 302313130113 is 311031313203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 302313130113 - 217 = 302312999041 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 302313130113.
It is not an unprimeable number, because it can be changed into a prime (302313130153) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 691006 + ... + 1040247.
It is an arithmetic number, because the mean of its divisors is an integer number (50386416416).
Almost surely, 2302313130113 is an apocalyptic number.
It is an amenable number.
302313130113 is a deficient number, since it is larger than the sum of its proper divisors (100778201215).
302313130113 is a wasteful number, since it uses less digits than its factorization.
302313130113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1789463.
The product of its (nonzero) digits is 486, while the sum is 21.
Adding to 302313130113 its reverse (311031313203), we get a palindrome (613344443316).
The spelling of 302313130113 in words is "three hundred two billion, three hundred thirteen million, one hundred thirty thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •