Base | Representation |
---|---|
bin | 1010110101101011101… |
… | …0100011110000100110 |
3 | 122210122012212220121100 |
4 | 2231122322203300212 |
5 | 11022323434101430 |
6 | 221313154500530 |
7 | 16311300324600 |
oct | 2553272436046 |
9 | 583565786540 |
10 | 186208893990 |
11 | 71a75080129 |
12 | 30108b94746 |
13 | 1473708c912 |
14 | 9026664170 |
15 | 4c9c855960 |
hex | 2b5aea3c26 |
186208893990 has 144 divisors (see below), whose sum is σ = 565268708160. Its totient is φ = 42404705280.
The previous prime is 186208893989. The next prime is 186208894013. The reversal of 186208893990 is 99398802681.
It is a Harshad number since it is a multiple of its sum of digits (63).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 71 ways as a sum of consecutive naturals, for example, 1117206 + ... + 1273014.
It is an arithmetic number, because the mean of its divisors is an integer number (3925477140).
Almost surely, 2186208893990 is an apocalyptic number.
186208893990 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 186208893990, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (282634354080).
186208893990 is an abundant number, since it is smaller than the sum of its proper divisors (379059814170).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
186208893990 is a wasteful number, since it uses less digits than its factorization.
186208893990 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 156107 (or 156097 counting only the distinct ones).
The product of its (nonzero) digits is 13436928, while the sum is 63.
The spelling of 186208893990 in words is "one hundred eighty-six billion, two hundred eight million, eight hundred ninety-three thousand, nine hundred ninety".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •