Base | Representation |
---|---|
bin | 111101110101111… |
… | …1000111100011000 |
3 | 12100121200011011200 |
4 | 1323223320330120 |
5 | 13222211244000 |
6 | 541524354200 |
7 | 102265040655 |
oct | 17353707430 |
9 | 5317604150 |
10 | 2075103000 |
11 | 975383663 |
12 | 49ab45960 |
13 | 270bb17c9 |
14 | 159848c2c |
15 | c229a500 |
hex | 7baf8f18 |
2075103000 has 96 divisors (see below), whose sum is σ = 7013878560. Its totient is φ = 553358400.
The previous prime is 2075102971. The next prime is 2075103001. The reversal of 2075103000 is 3015702.
It is a Harshad number since it is a multiple of its sum of digits (18).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2075103001) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 106284 + ... + 124283.
It is an arithmetic number, because the mean of its divisors is an integer number (73061235).
Almost surely, 22075103000 is an apocalyptic number.
2075103000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2075103000 is an abundant number, since it is smaller than the sum of its proper divisors (4938775560).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2075103000 is a wasteful number, since it uses less digits than its factorization.
2075103000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 230594 (or 230577 counting only the distinct ones).
The product of its (nonzero) digits is 210, while the sum is 18.
The square root of 2075103000 is about 45553.2984535697. The cubic root of 2075103000 is about 1275.4983057994.
Adding to 2075103000 its reverse (3015702), we get a palindrome (2078118702).
The spelling of 2075103000 in words is "two billion, seventy-five million, one hundred three thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •