Base | Representation |
---|---|
bin | 1000110011000110100… |
… | …01000101001111100111 |
3 | 1001220022201111100201212 |
4 | 10121203101011033213 |
5 | 14423114130224111 |
6 | 350514123342035 |
7 | 30561413142410 |
oct | 4314321051747 |
9 | 1056281440655 |
10 | 302313133031 |
11 | 107234978398 |
12 | 4a71008191b |
13 | 2267b121690 |
14 | 108bc42c807 |
15 | 7ce57c698b |
hex | 46634453e7 |
302313133031 has 16 divisors (see below), whose sum is σ = 372745767744. Its totient is φ = 238763337984.
The previous prime is 302313133027. The next prime is 302313133039. The reversal of 302313133031 is 130331313203.
It is a cyclic number.
It is not a de Polignac number, because 302313133031 - 22 = 302313133027 is a prime.
It is a super-2 number, since 2×3023131330312 (a number of 24 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 302313132988 and 302313133006.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (302313133039) 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 15 ways as a sum of consecutive naturals, for example, 2931470 + ... + 3032843.
It is an arithmetic number, because the mean of its divisors is an integer number (23296610484).
Almost surely, 2302313133031 is an apocalyptic number.
302313133031 is a deficient number, since it is larger than the sum of its proper divisors (70432634713).
302313133031 is a wasteful number, since it uses less digits than its factorization.
302313133031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 5964890.
The product of its (nonzero) digits is 1458, while the sum is 23.
Adding to 302313133031 its reverse (130331313203), we get a palindrome (432644446234).
The spelling of 302313133031 in words is "three hundred two billion, three hundred thirteen million, one hundred thirty-three thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •