Base | Representation |
---|---|
bin | 111100100011111… |
… | …1011000011000000 |
3 | 12020121210101120201 |
4 | 1321013323003000 |
5 | 13130210320000 |
6 | 533351214544 |
7 | 101233510051 |
oct | 17107730300 |
9 | 5217711521 |
10 | 2032120000 |
11 | 953095919 |
12 | 488677454 |
13 | 265012291 |
14 | 153c5a728 |
15 | bd60996a |
hex | 791fb0c0 |
2032120000 has 140 divisors (see below), whose sum is σ = 5099005296. Its totient is φ = 803200000.
The previous prime is 2032119937. The next prime is 2032120009. The reversal of 2032120000 is 212302.
It is a Harshad number since it is a multiple of its sum of digits (10).
It is not an unprimeable number, because it can be changed into a prime (2032120009) by changing a digit.
It is a polite number, since it can be written in 19 ways as a sum of consecutive naturals, for example, 4039749 + ... + 4040251.
Almost surely, 22032120000 is an apocalyptic number.
2032120000 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
It is a practical number, because each smaller number is the sum of distinct divisors of 2032120000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2549502648).
2032120000 is an abundant number, since it is smaller than the sum of its proper divisors (3066885296).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2032120000 is an equidigital number, since it uses as much as digits as its factorization.
2032120000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 636 (or 611 counting only the distinct ones).
The product of its (nonzero) digits is 24, while the sum is 10.
The square root of 2032120000 is about 45079.0416934522. The cubic root of 2032120000 is about 1266.6300389532.
Adding to 2032120000 its reverse (212302), we get a palindrome (2032332302).
The spelling of 2032120000 in words is "two billion, thirty-two million, one hundred twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •