Base | Representation |
---|---|
bin | 11101100100011100110… |
… | …000100011001010100000 |
3 | 21012020221201021220111002 |
4 | 131210130300203022200 |
5 | 231243020004120000 |
6 | 4153253331211132 |
7 | 266543622120641 |
oct | 35443460431240 |
9 | 7166851256432 |
10 | 2032002020000 |
11 | 7138491910a7 |
12 | 289995446aa8 |
13 | 119803630094 |
14 | 704c6b5b6c8 |
15 | 37ccc7678d5 |
hex | 1d91cc232a0 |
2032002020000 has 120 divisors (see below), whose sum is σ = 5000230863936. Its totient is φ = 812605536000.
The previous prime is 2032002019969. The next prime is 2032002020057. The reversal of 2032002020000 is 202002302.
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 19 ways as a sum of consecutive naturals, for example, 106450457 + ... + 106469543.
Almost surely, 22032002020000 is an apocalyptic number.
2032002020000 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 2032002020000, and also a Zumkeller number, because its divisors can be partitioned in two sets with the same sum (2500115431968).
2032002020000 is an abundant number, since it is smaller than the sum of its proper divisors (2968228843936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2032002020000 is an equidigital number, since it uses as much as digits as its factorization.
2032002020000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24440 (or 24417 counting only the distinct ones).
The product of its (nonzero) digits is 48, while the sum is 11.
Adding to 2032002020000 its reverse (202002302), we get a palindrome (2032204022302).
The spelling of 2032002020000 in words is "two trillion, thirty-two billion, two million, twenty thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •