Base | Representation |
---|---|
bin | 1000000011001010… |
… | …0100101101110001 |
3 | 12120120211000202002 |
4 | 2000302210231301 |
5 | 13411122204413 |
6 | 554224103345 |
7 | 104354666060 |
oct | 20062445561 |
9 | 5516730662 |
10 | 2160741233 |
11 | a09755962 |
12 | 503764b55 |
13 | 285867311 |
14 | 166d7c1d7 |
15 | c9a64958 |
hex | 80ca4b71 |
2160741233 has 12 divisors (see below), whose sum is σ = 2581457088. Its totient is φ = 1771536360.
The previous prime is 2160741217. The next prime is 2160741277. The reversal of 2160741233 is 3321470612.
It is a happy number.
It is not a de Polignac number, because 2160741233 - 24 = 2160741217 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 2160741196 and 2160741205.
It is not an unprimeable number, because it can be changed into a prime (2160741283) 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, 288053 + ... + 295458.
It is an arithmetic number, because the mean of its divisors is an integer number (215121424).
Almost surely, 22160741233 is an apocalyptic number.
2160741233 is a gapful number since it is divisible by the number (23) formed by its first and last digit.
It is an amenable number.
2160741233 is a deficient number, since it is larger than the sum of its proper divisors (420715855).
2160741233 is an equidigital number, since it uses as much as digits as its factorization.
2160741233 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 583564 (or 583541 counting only the distinct ones).
The product of its (nonzero) digits is 6048, while the sum is 29.
The square root of 2160741233 is about 46483.7738678778. The cubic root of 2160741233 is about 1292.8086617463.
The spelling of 2160741233 in words is "two billion, one hundred sixty million, seven hundred forty-one thousand, two hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •