Base | Representation |
---|---|
bin | 111110110010000… |
… | …1010110111000101 |
3 | 12102211000002010020 |
4 | 1331210022313011 |
5 | 13303244234134 |
6 | 545012245353 |
7 | 103130043060 |
oct | 17544126705 |
9 | 5384002106 |
10 | 2106633669 |
11 | 99115a068 |
12 | 4a9610859 |
13 | 2775a13ca |
14 | 15dad58d7 |
15 | c4e27b49 |
hex | 7d90adc5 |
2106633669 has 32 divisors (see below), whose sum is σ = 3310675200. Its totient is φ = 1166476800.
The previous prime is 2106633653. The next prime is 2106633673. The reversal of 2106633669 is 9663366012.
It is not a de Polignac number, because 2106633669 - 24 = 2106633653 is a prime.
It is a super-2 number, since 2×21066336692 = 8875810830728803122, which contains 22 as substring.
It is a Curzon number.
It is a self number, because there is not a number n which added to its sum of digits gives 2106633669.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2106633619) 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 31 ways as a sum of consecutive naturals, for example, 120079 + ... + 136499.
It is an arithmetic number, because the mean of its divisors is an integer number (103458600).
Almost surely, 22106633669 is an apocalyptic number.
It is an amenable number.
2106633669 is a deficient number, since it is larger than the sum of its proper divisors (1204041531).
2106633669 is a wasteful number, since it uses less digits than its factorization.
2106633669 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16621.
The product of its (nonzero) digits is 209952, while the sum is 42.
The square root of 2106633669 is about 45898.0791428138. The cubic root of 2106633669 is about 1281.9261505613.
The spelling of 2106633669 in words is "two billion, one hundred six million, six hundred thirty-three thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •