Base | Representation |
---|---|
bin | 1100001010111… |
… | …10110000010110 |
3 | 21010010012212010 |
4 | 12011132300112 |
5 | 202114144430 |
6 | 14044205050 |
7 | 2346556416 |
oct | 605366026 |
9 | 233105763 |
10 | 102099990 |
11 | 526a6263 |
12 | 2a239786 |
13 | 181ca5c5 |
14 | d7ba646 |
15 | 8e6bcb0 |
hex | 615ec16 |
102099990 has 64 divisors (see below), whose sum is σ = 259324416. Its totient is φ = 25673472.
The previous prime is 102099961. The next prime is 102099997. The reversal of 102099990 is 99990201.
It is a happy number.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102099997) 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 31 ways as a sum of consecutive naturals, for example, 49357 + ... + 51383.
It is an arithmetic number, because the mean of its divisors is an integer number (4051944).
Almost surely, 2102099990 is an apocalyptic number.
102099990 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 102099990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (129662208).
102099990 is an abundant number, since it is smaller than the sum of its proper divisors (157224426).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
102099990 is a wasteful number, since it uses less digits than its factorization.
102099990 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2133.
The product of its (nonzero) digits is 13122, while the sum is 39.
The square root of 102099990 is about 10104.4539684240. The cubic root of 102099990 is about 467.3854981861.
The spelling of 102099990 in words is "one hundred two million, ninety-nine thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.065 sec. • engine limits •