Base | Representation |
---|---|
bin | 111111100100101… |
… | …1000100000111101 |
3 | 12111122221001211101 |
4 | 1333021120200331 |
5 | 13332042304031 |
6 | 551401053101 |
7 | 103601420161 |
oct | 17711304075 |
9 | 5448831741 |
10 | 2133166141 |
11 | 9a5131327 |
12 | 4b6487191 |
13 | 27cc30cb2 |
14 | 163440ca1 |
15 | c7419361 |
hex | 7f25883d |
2133166141 has 16 divisors (see below), whose sum is σ = 2235340800. Its totient is φ = 2033319600.
The previous prime is 2133166127. The next prime is 2133166159. The reversal of 2133166141 is 1416613312.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-2133166141 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (2133166121) 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, 562590 + ... + 566368.
It is an arithmetic number, because the mean of its divisors is an integer number (139708800).
Almost surely, 22133166141 is an apocalyptic number.
It is an amenable number.
2133166141 is a deficient number, since it is larger than the sum of its proper divisors (102174659).
2133166141 is a wasteful number, since it uses less digits than its factorization.
2133166141 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4080.
The product of its digits is 2592, while the sum is 28.
The square root of 2133166141 is about 46186.2115896076. The cubic root of 2133166141 is about 1287.2855489241.
Adding to 2133166141 its reverse (1416613312), we get a palindrome (3549779453).
It can be divided in two parts, 2133 and 166141, that multiplied together give a triangular number (354378753 = T26622).
The spelling of 2133166141 in words is "two billion, one hundred thirty-three million, one hundred sixty-six thousand, one hundred forty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.019 sec. • engine limits •