Base | Representation |
---|---|
bin | 1100001100100… |
… | …00000110110011 |
3 | 21010111111010211 |
4 | 12012100012303 |
5 | 202142132011 |
6 | 14052404551 |
7 | 2351360641 |
oct | 606200663 |
9 | 233444124 |
10 | 102302131 |
11 | 52824118 |
12 | 2a316757 |
13 | 1826b609 |
14 | d830191 |
15 | 8eabb21 |
hex | 61901b3 |
102302131 has 4 divisors (see below), whose sum is σ = 102358512. Its totient is φ = 102245752.
The previous prime is 102302129. The next prime is 102302143. The reversal of 102302131 is 131203201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 131203201 = 23 ⋅5704487.
It is a cyclic number.
It is not a de Polignac number, because 102302131 - 21 = 102302129 is a prime.
It is a super-2 number, since 2×1023021312 = 20931452014282322, which contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102302171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (11) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 25375 + ... + 29128.
It is an arithmetic number, because the mean of its divisors is an integer number (25589628).
Almost surely, 2102302131 is an apocalyptic number.
102302131 is a deficient number, since it is larger than the sum of its proper divisors (56381).
102302131 is an equidigital number, since it uses as much as digits as its factorization.
102302131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 56380.
The product of its (nonzero) digits is 36, while the sum is 13.
The square root of 102302131 is about 10114.4515916583. The cubic root of 102302131 is about 467.6937433693.
Adding to 102302131 its reverse (131203201), we get a palindrome (233505332).
The spelling of 102302131 in words is "one hundred two million, three hundred two thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •