Base | Representation |
---|---|
bin | 1000110101010100… |
… | …1000101100010001 |
3 | 20010020200210020120 |
4 | 2031111020230101 |
5 | 14324002044311 |
6 | 1031141300453 |
7 | 112521153600 |
oct | 21525105421 |
9 | 6106623216 |
10 | 2371128081 |
11 | 1007492693 |
12 | 562104729 |
13 | 2ba31a28a |
14 | 186ca5a37 |
15 | dd271706 |
hex | 8d548b11 |
2371128081 has 12 divisors (see below), whose sum is σ = 3677668272. Its totient is φ = 1354930248.
The previous prime is 2371128037. The next prime is 2371128107. The reversal of 2371128081 is 1808211732.
It is not a de Polignac number, because 2371128081 - 27 = 2371127953 is a prime.
It is a super-2 number, since 2×23711280812 = 11244496753013485122, which contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (2371128281) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 8064915 + ... + 8065208.
It is an arithmetic number, because the mean of its divisors is an integer number (306472356).
Almost surely, 22371128081 is an apocalyptic number.
2371128081 is a gapful number since it is divisible by the number (21) formed by its first and last digit.
It is an amenable number.
2371128081 is a deficient number, since it is larger than the sum of its proper divisors (1306540191).
2371128081 is a wasteful number, since it uses less digits than its factorization.
2371128081 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16130140 (or 16130133 counting only the distinct ones).
The product of its (nonzero) digits is 5376, while the sum is 33.
The square root of 2371128081 is about 48694.2304693277. The cubic root of 2371128081 is about 1333.4753889410.
The spelling of 2371128081 in words is "two billion, three hundred seventy-one million, one hundred twenty-eight thousand, eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •