Base | Representation |
---|---|
bin | 1100010001100… |
… | …01111001101010 |
3 | 21011202011012200 |
4 | 12020301321222 |
5 | 202324333332 |
6 | 14114521030 |
7 | 2360121021 |
oct | 610617152 |
9 | 234664180 |
10 | 102964842 |
11 | 53137012 |
12 | 2a596176 |
13 | 18441156 |
14 | d9638b8 |
15 | 908d17c |
hex | 6231e6a |
102964842 has 24 divisors (see below), whose sum is σ = 223596516. Its totient is φ = 34243776.
The previous prime is 102964837. The next prime is 102964847. The reversal of 102964842 is 248469201.
102964842 is a `hidden beast` number, since 1 + 0 + 2 + 9 + 648 + 4 + 2 = 666.
It is an interprime number because it is at equal distance from previous prime (102964837) and next prime (102964847).
It can be written as a sum of positive squares in 2 ways, for example, as 81703521 + 21261321 = 9039^2 + 4611^2 .
It is a junction number, because it is equal to n+sod(n) for n = 102964797 and 102964806.
It is not an unprimeable number, because it can be changed into a prime (102964847) 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 11 ways as a sum of consecutive naturals, for example, 1968 + ... + 14484.
Almost surely, 2102964842 is an apocalyptic number.
102964842 is an abundant number, since it is smaller than the sum of its proper divisors (120631674).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102964842 is a wasteful number, since it uses less digits than its factorization.
102964842 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12982 (or 12979 counting only the distinct ones).
The product of its (nonzero) digits is 27648, while the sum is 36.
The square root of 102964842 is about 10147.1593069194. The cubic root of 102964842 is about 468.7014738033.
The spelling of 102964842 in words is "one hundred two million, nine hundred sixty-four thousand, eight hundred forty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •