Base | Representation |
---|---|
bin | 1100001110011… |
… | …11110110111101 |
3 | 21010222202100022 |
4 | 12013033312331 |
5 | 202224011021 |
6 | 14102141525 |
7 | 2353526153 |
oct | 607176675 |
9 | 233882308 |
10 | 102563261 |
11 | 52992329 |
12 | 2a4218a5 |
13 | 18330428 |
14 | d89b3d3 |
15 | 900e1ab |
hex | 61cfdbd |
102563261 has 4 divisors (see below), whose sum is σ = 108596412. Its totient is φ = 96530112.
The previous prime is 102563257. The next prime is 102563281. The reversal of 102563261 is 162365201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 162365201 = 109 ⋅1489589.
It can be written as a sum of positive squares in 2 ways, for example, as 72148036 + 30415225 = 8494^2 + 5515^2 .
It is a cyclic number.
It is not a de Polignac number, because 102563261 - 22 = 102563257 is a prime.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 102563261.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102563281) 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, 3016550 + ... + 3016583.
It is an arithmetic number, because the mean of its divisors is an integer number (27149103).
Almost surely, 2102563261 is an apocalyptic number.
It is an amenable number.
102563261 is a deficient number, since it is larger than the sum of its proper divisors (6033151).
102563261 is an equidigital number, since it uses as much as digits as its factorization.
102563261 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6033150.
The product of its (nonzero) digits is 2160, while the sum is 26.
The square root of 102563261 is about 10127.3521218530. The cubic root of 102563261 is about 468.0913405008.
The spelling of 102563261 in words is "one hundred two million, five hundred sixty-three thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •