Base | Representation |
---|---|
bin | 1100001110000… |
… | …11011110010100 |
3 | 21010220011202110 |
4 | 12013003132110 |
5 | 202220400112 |
6 | 14101111020 |
7 | 2353225233 |
oct | 607033624 |
9 | 233804673 |
10 | 102512532 |
11 | 52958201 |
12 | 2a3b8470 |
13 | 18313305 |
14 | d886b1a |
15 | 8eee13c |
hex | 61c3794 |
102512532 has 12 divisors (see below), whose sum is σ = 239195936. Its totient is φ = 34170840.
The previous prime is 102512497. The next prime is 102512539. The reversal of 102512532 is 235215201.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 102512499 and 102512508.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102512539) 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 3 ways as a sum of consecutive naturals, for example, 4271344 + ... + 4271367.
Almost surely, 2102512532 is an apocalyptic number.
102512532 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102512532 is an abundant number, since it is smaller than the sum of its proper divisors (136683404).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102512532 is a wasteful number, since it uses less digits than its factorization.
102512532 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 8542718 (or 8542716 counting only the distinct ones).
The product of its (nonzero) digits is 600, while the sum is 21.
The square root of 102512532 is about 10124.8472581072. The cubic root of 102512532 is about 468.0141532720.
Adding to 102512532 its reverse (235215201), we get a palindrome (337727733).
The spelling of 102512532 in words is "one hundred two million, five hundred twelve thousand, five hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •