Base | Representation |
---|---|
bin | 1100001110101… |
… | …01100101110101 |
3 | 21011000221112221 |
4 | 12013111211311 |
5 | 202230233431 |
6 | 14102442341 |
7 | 2353654465 |
oct | 607254565 |
9 | 234027487 |
10 | 102586741 |
11 | 529a8a34 |
12 | 2a4333b1 |
13 | 1833b01a |
14 | d8a5ba5 |
15 | 9016111 |
hex | 61d5975 |
102586741 has 4 divisors (see below), whose sum is σ = 102609772. Its totient is φ = 102563712.
The previous prime is 102586727. The next prime is 102586787. The reversal of 102586741 is 147685201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 147685201 = 59 ⋅2503139.
It can be written as a sum of positive squares in 2 ways, for example, as 17098225 + 85488516 = 4135^2 + 9246^2 .
It is a cyclic number.
It is not a de Polignac number, because 102586741 - 25 = 102586709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102586697 and 102586706.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102586241) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 2460 + ... + 14533.
It is an arithmetic number, because the mean of its divisors is an integer number (25652443).
Almost surely, 2102586741 is an apocalyptic number.
It is an amenable number.
102586741 is a deficient number, since it is larger than the sum of its proper divisors (23031).
102586741 is an equidigital number, since it uses as much as digits as its factorization.
102586741 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 23030.
The product of its (nonzero) digits is 13440, while the sum is 34.
The square root of 102586741 is about 10128.5112923865. The cubic root of 102586741 is about 468.1270581186.
The spelling of 102586741 in words is "one hundred two million, five hundred eighty-six thousand, seven hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •