Base | Representation |
---|---|
bin | 1000110010110000101… |
… | …10111100101001101001 |
3 | 1001212211222010101212101 |
4 | 10121120112330221221 |
5 | 14422230302340241 |
6 | 350444025013401 |
7 | 30554031441520 |
oct | 4313026745151 |
9 | 1055758111771 |
10 | 302130121321 |
11 | 107150638a46 |
12 | 4a67a924261 |
13 | 2264c234a22 |
14 | 108a1dcd4b7 |
15 | 7cd46c5e31 |
hex | 46585bca69 |
302130121321 has 8 divisors (see below), whose sum is σ = 346416297920. Its totient is φ = 258125127408.
The previous prime is 302130121259. The next prime is 302130121333. The reversal of 302130121321 is 123121031203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-302130121321 is a prime.
It is a super-2 number, since 2×3021301213212 (a number of 24 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (302130121351) 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 7 ways as a sum of consecutive naturals, for example, 70293366 + ... + 70297663.
It is an arithmetic number, because the mean of its divisors is an integer number (43302037240).
Almost surely, 2302130121321 is an apocalyptic number.
It is an amenable number.
302130121321 is a deficient number, since it is larger than the sum of its proper divisors (44286176599).
302130121321 is a wasteful number, since it uses less digits than its factorization.
302130121321 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 140591343.
The product of its (nonzero) digits is 216, while the sum is 19.
Adding to 302130121321 its reverse (123121031203), we get a palindrome (425251152524).
The spelling of 302130121321 in words is "three hundred two billion, one hundred thirty million, one hundred twenty-one thousand, three hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •