Base | Representation |
---|---|
bin | 1000011011001000… |
… | …1011111101111110 |
3 | 12211121001002210010 |
4 | 2012302023331332 |
5 | 14112343200131 |
6 | 1012215324050 |
7 | 110015521413 |
oct | 20662137576 |
9 | 5747032703 |
10 | 2261303166 |
11 | a604a05a1 |
12 | 531380626 |
13 | 2a0646815 |
14 | 17647810a |
15 | d37cab46 |
hex | 86c8bf7e |
2261303166 has 8 divisors (see below), whose sum is σ = 4522606344. Its totient is φ = 753767720.
The previous prime is 2261303117. The next prime is 2261303203. The reversal of 2261303166 is 6613031622.
It is a sphenic number, since it is the product of 3 distinct primes.
2261303166 is an admirable number.
It is a super-2 number, since 2×22613031662 = 10226984017123247112, which contains 22 as substring.
It is a congruent number.
It is an unprimeable number.
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 3 ways as a sum of consecutive naturals, for example, 188441925 + ... + 188441936.
It is an arithmetic number, because the mean of its divisors is an integer number (565325793).
Almost surely, 22261303166 is an apocalyptic number.
2261303166 is a primitive abundant number, since it is smaller than the sum of its proper divisors, none of which is abundant.
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2261303166 is a wasteful number, since it uses less digits than its factorization.
2261303166 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 376883866.
The product of its (nonzero) digits is 7776, while the sum is 30.
The square root of 2261303166 is about 47553.1614721882. The cubic root of 2261303166 is about 1312.5613051455.
Adding to 2261303166 its reverse (6613031622), we get a palindrome (8874334788).
The spelling of 2261303166 in words is "two billion, two hundred sixty-one million, three hundred three thousand, one hundred sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •