Base | Representation |
---|---|
bin | 1100001100101… |
… | …11111001010000 |
3 | 21010120002220100 |
4 | 12012113321100 |
5 | 202144142112 |
6 | 14053212400 |
7 | 2351552643 |
oct | 606277120 |
9 | 233502810 |
10 | 102334032 |
11 | 52846089 |
12 | 2a331100 |
13 | 1827cca8 |
14 | d83ba5a |
15 | 8eb62dc |
hex | 6197e50 |
102334032 has 60 divisors (see below), whose sum is σ = 293395284. Its totient is φ = 33277440.
The previous prime is 102334021. The next prime is 102334079. The reversal of 102334032 is 230433201.
It can be written as a sum of positive squares in 2 ways, for example, as 5035536 + 97298496 = 2244^2 + 9864^2 .
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a junction number, because it is equal to n+sod(n) for n = 102333996 and 102334014.
It is a congruent number.
It is an unprimeable number.
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, 2763 + ... + 14570.
Almost surely, 2102334032 is an apocalyptic number.
102334032 is a gapful number since it is divisible by the number (12) formed by its first and last digit.
It is an amenable number.
102334032 is an abundant number, since it is smaller than the sum of its proper divisors (191061252).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102334032 is a wasteful number, since it uses less digits than its factorization.
102334032 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17388 (or 17379 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 18.
The square root of 102334032 is about 10116.0284697108. The cubic root of 102334032 is about 467.7423521565.
Adding to 102334032 its reverse (230433201), we get a palindrome (332767233).
The spelling of 102334032 in words is "one hundred two million, three hundred thirty-four thousand, thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •