Base | Representation |
---|---|
bin | 111100111000111… |
… | …0110101100101000 |
3 | 12021101110212002102 |
4 | 1321301312230220 |
5 | 13141014042412 |
6 | 534422552532 |
7 | 101426111300 |
oct | 17161665450 |
9 | 5241425072 |
10 | 2043112232 |
11 | 959313507 |
12 | 490298748 |
13 | 267390665 |
14 | 1554bc600 |
15 | be57b8c2 |
hex | 79c76b28 |
2043112232 has 48 divisors (see below), whose sum is σ = 4466940660. Its totient is φ = 873524736.
The previous prime is 2043112219. The next prime is 2043112289. The reversal of 2043112232 is 2322113402.
It can be written as a sum of positive squares in 2 ways, for example, as 1449020356 + 594091876 = 38066^2 + 24374^2 .
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 11 ways as a sum of consecutive naturals, for example, 163718 + ... + 175754.
Almost surely, 22043112232 is an apocalyptic number.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2043112232, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2233470330).
2043112232 is an abundant number, since it is smaller than the sum of its proper divisors (2423828428).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2043112232 is a wasteful number, since it uses less digits than its factorization.
2043112232 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12490 (or 12479 counting only the distinct ones).
The product of its (nonzero) digits is 576, while the sum is 20.
The square root of 2043112232 is about 45200.7990194864. The cubic root of 2043112232 is about 1268.9097701295.
Adding to 2043112232 its reverse (2322113402), we get a palindrome (4365225634).
The spelling of 2043112232 in words is "two billion, forty-three million, one hundred twelve thousand, two hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •