Base | Representation |
---|---|
bin | 1000000101100010… |
… | …1111100011111011 |
3 | 12121021122101020220 |
4 | 2001120233203323 |
5 | 13421202402011 |
6 | 555222351123 |
7 | 104536021560 |
oct | 20130574373 |
9 | 5537571226 |
10 | 2170747131 |
11 | a1436a4a3 |
12 | 506b8b4a3 |
13 | 28795b777 |
14 | 168424867 |
15 | ca88e506 |
hex | 8162f8fb |
2170747131 has 32 divisors (see below), whose sum is σ = 3594240000. Its totient is φ = 1137227040.
The previous prime is 2170747081. The next prime is 2170747133. The reversal of 2170747131 is 1317470712.
It is not a de Polignac number, because 2170747131 - 227 = 2036529403 is a prime.
It is a super-2 number, since 2×21707471312 = 9424286213489462322, which contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 2170747092 and 2170747101.
It is not an unprimeable number, because it can be changed into a prime (2170747133) 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, 75381 + ... + 100118.
It is an arithmetic number, because the mean of its divisors is an integer number (112320000).
Almost surely, 22170747131 is an apocalyptic number.
2170747131 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
2170747131 is a deficient number, since it is larger than the sum of its proper divisors (1423492869).
2170747131 is a wasteful number, since it uses less digits than its factorization.
2170747131 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 175559.
The product of its (nonzero) digits is 8232, while the sum is 33.
The square root of 2170747131 is about 46591.2774132670. The cubic root of 2170747131 is about 1294.8011562935.
The spelling of 2170747131 in words is "two billion, one hundred seventy million, seven hundred forty-seven thousand, one hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •