Base | Representation |
---|---|
bin | 1100010000110… |
… | …11101000011110 |
3 | 21011120112002110 |
4 | 12020123220132 |
5 | 202313424010 |
6 | 14112534450 |
7 | 2356261056 |
oct | 610335036 |
9 | 234515073 |
10 | 102873630 |
11 | 53084532 |
12 | 2a551426 |
13 | 1840b792 |
14 | d93c566 |
15 | 9071120 |
hex | 621ba1e |
102873630 has 64 divisors (see below), whose sum is σ = 267556608. Its totient is φ = 25213440.
The previous prime is 102873629. The next prime is 102873649. The reversal of 102873630 is 36378201.
It is a Harshad number since it is a multiple of its sum of digits (30).
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 31 ways as a sum of consecutive naturals, for example, 19585 + ... + 24275.
It is an arithmetic number, because the mean of its divisors is an integer number (4180572).
Almost surely, 2102873630 is an apocalyptic number.
102873630 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is a practical number, because each smaller number is the sum of distinct divisors of 102873630, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (133778304).
102873630 is an abundant number, since it is smaller than the sum of its proper divisors (164682978).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102873630 is a wasteful number, since it uses less digits than its factorization.
102873630 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4761.
The product of its (nonzero) digits is 6048, while the sum is 30.
The square root of 102873630 is about 10142.6638512769. The cubic root of 102873630 is about 468.5630322796.
The spelling of 102873630 in words is "one hundred two million, eight hundred seventy-three thousand, six hundred thirty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •