Base | Representation |
---|---|
bin | 1100001110110… |
… | …10000010111111 |
3 | 21011001212120212 |
4 | 12013122002333 |
5 | 202231324431 |
6 | 14103103035 |
7 | 2354061626 |
oct | 607320277 |
9 | 234055525 |
10 | 102604991 |
11 | 52a10715 |
12 | 2a441a7b |
13 | 18346418 |
14 | d8ac6bd |
15 | 901b72b |
hex | 61da0bf |
102604991 has 4 divisors (see below), whose sum is σ = 103620984. Its totient is φ = 101589000.
The previous prime is 102604981. The next prime is 102604993. The reversal of 102604991 is 199406201.
It is a semiprime because it is the product of two primes, and also an emirpimes, since its reverse is a distinct semiprime: 199406201 = 173 ⋅1152637.
It is a cyclic number.
It is not a de Polignac number, because 102604991 - 210 = 102603967 is a prime.
It is a super-2 number, since 2×1026049912 = 21055568356220162, which contains 22 as substring.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102604993) 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, 507845 + ... + 508046.
It is an arithmetic number, because the mean of its divisors is an integer number (25905246).
Almost surely, 2102604991 is an apocalyptic number.
102604991 is a deficient number, since it is larger than the sum of its proper divisors (1015993).
102604991 is a wasteful number, since it uses less digits than its factorization.
102604991 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1015992.
The product of its (nonzero) digits is 3888, while the sum is 32.
The square root of 102604991 is about 10129.4121744551. The cubic root of 102604991 is about 468.1548161315.
It can be divided in two parts, 10260 and 4991, that added together give a palindrome (15251).
The spelling of 102604991 in words is "one hundred two million, six hundred four thousand, nine hundred ninety-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •