Base | Representation |
---|---|
bin | 111101100100111… |
… | …0001110111101011 |
3 | 12022222211212020100 |
4 | 1323021301313223 |
5 | 13212414124011 |
6 | 541005000443 |
7 | 102126036246 |
oct | 17311616753 |
9 | 5288755210 |
10 | 2066161131 |
11 | 970326491 |
12 | 497b53123 |
13 | 26c0a0768 |
14 | 15859c25d |
15 | c15d0d56 |
hex | 7b271deb |
2066161131 has 24 divisors (see below), whose sum is σ = 3031033824. Its totient is φ = 1356001920.
The previous prime is 2066161109. The next prime is 2066161159. The reversal of 2066161131 is 1311616602.
2066161131 is a `hidden beast` number, since 2 + 0 + 6 + 616 + 11 + 31 = 666.
It is not a de Polignac number, because 2066161131 - 27 = 2066161003 is a prime.
It is a super-2 number, since 2×20661611312 = 8538043638510398322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2066161095 and 2066161104.
It is not an unprimeable number, because it can be changed into a prime (2066561131) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 507255 + ... + 511311.
It is an arithmetic number, because the mean of its divisors is an integer number (126293076).
Almost surely, 22066161131 is an apocalyptic number.
2066161131 is a deficient number, since it is larger than the sum of its proper divisors (964872693).
2066161131 is a wasteful number, since it uses less digits than its factorization.
2066161131 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4931 (or 4928 counting only the distinct ones).
The product of its (nonzero) digits is 1296, while the sum is 27.
The square root of 2066161131 is about 45455.0451655259. The cubic root of 2066161131 is about 1273.6635759220.
Adding to 2066161131 its reverse (1311616602), we get a palindrome (3377777733).
The spelling of 2066161131 in words is "two billion, sixty-six million, one hundred sixty-one thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •