Base | Representation |
---|---|
bin | 1100001110000… |
… | …00011110010001 |
3 | 21010212112220020 |
4 | 12013000132101 |
5 | 202220001431 |
6 | 14100534053 |
7 | 2353144344 |
oct | 607003621 |
9 | 233775806 |
10 | 102500241 |
11 | 52949a48 |
12 | 2a3b1329 |
13 | 1830a83c |
14 | d88245b |
15 | 8eea696 |
hex | 61c0791 |
102500241 has 4 divisors (see below), whose sum is σ = 136666992. Its totient is φ = 68333492.
The previous prime is 102500227. The next prime is 102500243. The reversal of 102500241 is 142005201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102500241 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 102500241.
It is not an unprimeable number, because it can be changed into a prime (102500243) 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, 17083371 + ... + 17083376.
It is an arithmetic number, because the mean of its divisors is an integer number (34166748).
Almost surely, 2102500241 is an apocalyptic number.
It is an amenable number.
102500241 is a deficient number, since it is larger than the sum of its proper divisors (34166751).
102500241 is an equidigital number, since it uses as much as digits as its factorization.
102500241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34166750.
The product of its (nonzero) digits is 80, while the sum is 15.
The square root of 102500241 is about 10124.2402677929. The cubic root of 102500241 is about 467.9954479432.
Adding to 102500241 its reverse (142005201), we get a palindrome (244505442).
The spelling of 102500241 in words is "one hundred two million, five hundred thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.001 sec. • engine limits •