Base | Representation |
---|---|
bin | 1100001101110… |
… | …00001111100010 |
3 | 21010210211122200 |
4 | 12012320033202 |
5 | 202212412110 |
6 | 14100114030 |
7 | 2352644145 |
oct | 606701742 |
9 | 233724580 |
10 | 102466530 |
11 | 52926691 |
12 | 2a395916 |
13 | 182c83aa |
14 | d87405c |
15 | 8ee06c0 |
hex | 61b83e2 |
102466530 has 48 divisors (see below), whose sum is σ = 267096960. Its totient is φ = 27254304.
The previous prime is 102466459. The next prime is 102466537. The reversal of 102466530 is 35664201.
102466530 is a `hidden beast` number, since 1 + 0 + 2 + 4 + 6 + 653 + 0 = 666.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102466494 and 102466503.
It is not an unprimeable number, because it can be changed into a prime (102466537) 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 23 ways as a sum of consecutive naturals, for example, 40441 + ... + 42899.
It is an arithmetic number, because the mean of its divisors is an integer number (5564520).
Almost surely, 2102466530 is an apocalyptic number.
102466530 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
102466530 is an abundant number, since it is smaller than the sum of its proper divisors (164630430).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102466530 is a wasteful number, since it uses less digits than its factorization.
102466530 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2935 (or 2932 counting only the distinct ones).
The product of its (nonzero) digits is 4320, while the sum is 27.
The square root of 102466530 is about 10122.5752652178. The cubic root of 102466530 is about 467.9441364396.
The spelling of 102466530 in words is "one hundred two million, four hundred sixty-six thousand, five hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •