Base | Representation |
---|---|
bin | 1100001101101… |
… | …10011100000101 |
3 | 21010210110112000 |
4 | 12012312130011 |
5 | 202212143031 |
6 | 14100015513 |
7 | 2352613461 |
oct | 606663405 |
9 | 233713460 |
10 | 102459141 |
11 | 52921084 |
12 | 2a391599 |
13 | 182c4c15 |
14 | d8714a1 |
15 | 8edd3e6 |
hex | 61b6705 |
102459141 has 16 divisors (see below), whose sum is σ = 152366400. Its totient is φ = 68047344.
The previous prime is 102459139. The next prime is 102459143. The reversal of 102459141 is 141954201.
102459141 is a `hidden beast` number, since 10 + 24 + 591 + 41 = 666.
It is an interprime number because it is at equal distance from previous prime (102459139) and next prime (102459143).
It is not a de Polignac number, because 102459141 - 21 = 102459139 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (27).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102459143) 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 15 ways as a sum of consecutive naturals, for example, 210 + ... + 14316.
It is an arithmetic number, because the mean of its divisors is an integer number (9522900).
Almost surely, 2102459141 is an apocalyptic number.
It is an amenable number.
102459141 is a deficient number, since it is larger than the sum of its proper divisors (49907259).
102459141 is a wasteful number, since it uses less digits than its factorization.
102459141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 14385 (or 14379 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 27.
The square root of 102459141 is about 10122.2102823445. The cubic root of 102459141 is about 467.9328881412.
The spelling of 102459141 in words is "one hundred two million, four hundred fifty-nine thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •