Base | Representation |
---|---|
bin | 1000110010110000101… |
… | …10011111100011010011 |
3 | 1001212211221220100100221 |
4 | 10121120112133203103 |
5 | 14422230240032011 |
6 | 350444022253511 |
7 | 30554030434156 |
oct | 4313026374323 |
9 | 1055757810327 |
10 | 302130002131 |
11 | 107150567441 |
12 | 4a67a887297 |
13 | 2264c1c26b9 |
14 | 108a1d9bc9d |
15 | 7cd46a0971 |
hex | 465859f8d3 |
302130002131 has 8 divisors (see below), whose sum is σ = 312205492224. Its totient is φ = 292075097160.
The previous prime is 302130002123. The next prime is 302130002143. The reversal of 302130002131 is 131200031203.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 302130002131 - 23 = 302130002123 is a prime.
It is a super-2 number, since 2×3021300021312 (a number of 24 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (302130002431) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5116435 + ... + 5175148.
It is an arithmetic number, because the mean of its divisors is an integer number (39025686528).
Almost surely, 2302130002131 is an apocalyptic number.
302130002131 is a gapful number since it is divisible by the number (31) formed by its first and last digit.
302130002131 is a deficient number, since it is larger than the sum of its proper divisors (10075490093).
302130002131 is a wasteful number, since it uses less digits than its factorization.
302130002131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10292561.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 302130002131 its reverse (131200031203), we get a palindrome (433330033334).
The spelling of 302130002131 in words is "three hundred two billion, one hundred thirty million, two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •