Base | Representation |
---|---|
bin | 111101001000100… |
… | …1110001111011100 |
3 | 12021221221121210021 |
4 | 1322101032033130 |
5 | 13200120211012 |
6 | 535315121524 |
7 | 101556026620 |
oct | 17221161734 |
9 | 5257847707 |
10 | 2051335132 |
11 | 962a1a4a0 |
12 | 492ba32a4 |
13 | 268cac392 |
14 | 15661d180 |
15 | c0153007 |
hex | 7a44e3dc |
2051335132 has 48 divisors (see below), whose sum is σ = 4670249472. Its totient is φ = 764470080.
The previous prime is 2051335087. The next prime is 2051335147. The reversal of 2051335132 is 2315331502.
It is a junction number, because it is equal to n+sod(n) for n = 2051335097 and 2051335106.
It is a congruent number.
It is an unprimeable number.
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, 137703 + ... + 151870.
It is an arithmetic number, because the mean of its divisors is an integer number (97296864).
Almost surely, 22051335132 is an apocalyptic number.
2051335132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
2051335132 is an abundant number, since it is smaller than the sum of its proper divisors (2618914340).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2051335132 is a wasteful number, since it uses less digits than its factorization.
2051335132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 289618 (or 289616 counting only the distinct ones).
The product of its (nonzero) digits is 2700, while the sum is 25.
The square root of 2051335132 is about 45291.6673572524. The cubic root of 2051335132 is about 1270.6098156383.
Adding to 2051335132 its reverse (2315331502), we get a palindrome (4366666634).
The spelling of 2051335132 in words is "two billion, fifty-one million, three hundred thirty-five thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.152 sec. • engine limits •