Base | Representation |
---|---|
bin | 1100001011001… |
… | …10011000110011 |
3 | 21010011210201221 |
4 | 12011212120303 |
5 | 202121200001 |
6 | 14045005511 |
7 | 2350046515 |
oct | 605463063 |
9 | 233153657 |
10 | 102131251 |
11 | 527177a2 |
12 | 2a253897 |
13 | 1820b8c1 |
14 | d7c7bb5 |
15 | 8e761a1 |
hex | 6166633 |
102131251 has 8 divisors (see below), whose sum is σ = 108803520. Its totient is φ = 95588712.
The previous prime is 102131233. The next prime is 102131269. The reversal of 102131251 is 152131201.
It is an interprime number because it is at equal distance from previous prime (102131233) and next prime (102131269).
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 102131251 - 25 = 102131219 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102131231) 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, 30805 + ... + 33958.
It is an arithmetic number, because the mean of its divisors is an integer number (13600440).
Almost surely, 2102131251 is an apocalyptic number.
102131251 is a deficient number, since it is larger than the sum of its proper divisors (6672269).
102131251 is an equidigital number, since it uses as much as digits as its factorization.
102131251 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 64865.
The product of its (nonzero) digits is 60, while the sum is 16.
The square root of 102131251 is about 10106.0007421334. Note that the first 3 decimals coincide. The cubic root of 102131251 is about 467.4331947207.
Adding to 102131251 its reverse (152131201), we get a palindrome (254262452).
The spelling of 102131251 in words is "one hundred two million, one hundred thirty-one thousand, two hundred fifty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •