Base | Representation |
---|---|
bin | 1100001011000… |
… | …11101100110001 |
3 | 21010011020122011 |
4 | 12011203230301 |
5 | 202120321431 |
6 | 14044442521 |
7 | 2350002436 |
oct | 605435461 |
9 | 233136564 |
10 | 102120241 |
11 | 5270a4a3 |
12 | 2a249441 |
13 | 182068a2 |
14 | d7c3b8d |
15 | 8e72cb1 |
hex | 6163b31 |
102120241 has 8 divisors (see below), whose sum is σ = 110168424. Its totient is φ = 94298880.
The previous prime is 102120203. The next prime is 102120301. The reversal of 102120241 is 142021201.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 24750625 + 77369616 = 4975^2 + 8796^2 .
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 102120241 - 29 = 102119729 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102120341) 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, 55770 + ... + 57571.
It is an arithmetic number, because the mean of its divisors is an integer number (13771053).
Almost surely, 2102120241 is an apocalyptic number.
It is an amenable number.
102120241 is a deficient number, since it is larger than the sum of its proper divisors (8048183).
102120241 is a wasteful number, since it uses less digits than its factorization.
102120241 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 113411.
The product of its (nonzero) digits is 32, while the sum is 13.
The square root of 102120241 is about 10105.4560015865. The cubic root of 102120241 is about 467.4163973011.
Adding to 102120241 its reverse (142021201), we get a palindrome (244141442).
The spelling of 102120241 in words is "one hundred two million, one hundred twenty thousand, two hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •