Base | Representation |
---|---|
bin | 111110100111101… |
… | …0011110000001010 |
3 | 12102102201020121101 |
4 | 1331033103300022 |
5 | 13300344240231 |
6 | 544255132014 |
7 | 103032415450 |
oct | 17517236012 |
9 | 5372636541 |
10 | 2101165066 |
11 | 989064460 |
12 | 4a781400a |
13 | 276408250 |
14 | 15d0b09d0 |
15 | c46e7661 |
hex | 7d3d3c0a |
2101165066 has 32 divisors (see below), whose sum is σ = 4231721088. Its totient is φ = 755663040.
The previous prime is 2101165063. The next prime is 2101165081. The reversal of 2101165066 is 6605611012.
It is a super-3 number, since 3×21011650663 (a number of 29 digits) contains 333 as substring.
It is not an unprimeable number, because it can be changed into a prime (2101165061) 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 15 ways as a sum of consecutive naturals, for example, 522765 + ... + 526768.
It is an arithmetic number, because the mean of its divisors is an integer number (132241284).
Almost surely, 22101165066 is an apocalyptic number.
2101165066 is a gapful number since it is divisible by the number (26) formed by its first and last digit.
2101165066 is an abundant number, since it is smaller than the sum of its proper divisors (2130556022).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2101165066 is a wasteful number, since it uses less digits than its factorization.
2101165066 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1049566.
The product of its (nonzero) digits is 2160, while the sum is 28.
The square root of 2101165066 is about 45838.4670991516. The cubic root of 2101165066 is about 1280.8159401336.
Adding to 2101165066 its reverse (6605611012), we get a palindrome (8706776078).
The spelling of 2101165066 in words is "two billion, one hundred one million, one hundred sixty-five thousand, sixty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •