Base | Representation |
---|---|
bin | 111110110001001… |
… | …1111011111110100 |
3 | 12102210011201212210 |
4 | 1331202133133310 |
5 | 13303141201113 |
6 | 544555013420 |
7 | 103123232010 |
oct | 17542373764 |
9 | 5383151783 |
10 | 2106193908 |
11 | 990989725 |
12 | 4a943a270 |
13 | 2774791b0 |
14 | 15da1d540 |
15 | c4d8c6c3 |
hex | 7d89f7f4 |
2106193908 has 96 divisors (see below), whose sum is σ = 6096584704. Its totient is φ = 551069568.
The previous prime is 2106193907. The next prime is 2106193931. The reversal of 2106193908 is 8093916012.
It is a Harshad number since it is a multiple of its sum of digits (39).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2106193907) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 131091 + ... + 146277.
Almost surely, 22106193908 is an apocalyptic number.
2106193908 is a gapful number since it is divisible by the number (28) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2106193908, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (3048292352).
2106193908 is an abundant number, since it is smaller than the sum of its proper divisors (3990390796).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2106193908 is a wasteful number, since it uses less digits than its factorization.
2106193908 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 15341 (or 15339 counting only the distinct ones).
The product of its (nonzero) digits is 23328, while the sum is 39.
The square root of 2106193908 is about 45893.2882674580. The cubic root of 2106193908 is about 1281.8369434112.
The spelling of 2106193908 in words is "two billion, one hundred six million, one hundred ninety-three thousand, nine hundred eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •