Base | Representation |
---|---|
bin | 111110011001111… |
… | …0001001010011100 |
3 | 12101221010110020001 |
4 | 1330303301022130 |
5 | 13242022224000 |
6 | 543440304044 |
7 | 102614146243 |
oct | 17463611234 |
9 | 5357113201 |
10 | 2093945500 |
11 | 984a83279 |
12 | 4a5312024 |
13 | 274a7b10a |
14 | 15c15195a |
15 | c3c6d46a |
hex | 7ccf129c |
2093945500 has 24 divisors (see below), whose sum is σ = 4573178064. Its totient is φ = 837578000.
The previous prime is 2093945473. The next prime is 2093945509. The reversal of 2093945500 is 55493902.
It is a self number, because there is not a number n which added to its sum of digits gives 2093945500.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2093945509) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 2093446 + ... + 2094445.
It is an arithmetic number, because the mean of its divisors is an integer number (190549086).
Almost surely, 22093945500 is an apocalyptic number.
2093945500 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2093945500 is an abundant number, since it is smaller than the sum of its proper divisors (2479232564).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2093945500 is a wasteful number, since it uses less digits than its factorization.
2093945500 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4187910 (or 4187898 counting only the distinct ones).
The product of its (nonzero) digits is 48600, while the sum is 37.
The square root of 2093945500 is about 45759.6492556488. The cubic root of 2093945500 is about 1279.3473031387.
The spelling of 2093945500 in words is "two billion, ninety-three million, nine hundred forty-five thousand, five hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •