Base | Representation |
---|---|
bin | 1100010001010… |
… | …01111111010101 |
3 | 21011200111202111 |
4 | 12020221333111 |
5 | 202322314222 |
6 | 14114111021 |
7 | 2356624366 |
oct | 610517725 |
9 | 234614674 |
10 | 102932437 |
11 | 53114733 |
12 | 2a57b471 |
13 | 1842c48a |
14 | d955b6d |
15 | 9083777 |
hex | 6229fd5 |
102932437 has 8 divisors (see below), whose sum is σ = 104781240. Its totient is φ = 101088960.
The previous prime is 102932393. The next prime is 102932441. The reversal of 102932437 is 734239201.
It can be written as a sum of positive squares in 4 ways, for example, as 49364676 + 53567761 = 7026^2 + 7319^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102932437 - 27 = 102932309 is a prime.
It is a super-3 number, since 3×1029324373 (a number of 25 digits) contains 333 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 102932399 and 102932408.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102932447) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 74283 + ... + 75655.
It is an arithmetic number, because the mean of its divisors is an integer number (13097655).
Almost surely, 2102932437 is an apocalyptic number.
It is an amenable number.
102932437 is a deficient number, since it is larger than the sum of its proper divisors (1848803).
102932437 is a wasteful number, since it uses less digits than its factorization.
102932437 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2663.
The product of its (nonzero) digits is 9072, while the sum is 31.
The square root of 102932437 is about 10145.5624289637. The cubic root of 102932437 is about 468.6522988791.
The spelling of 102932437 in words is "one hundred two million, nine hundred thirty-two thousand, four hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •