Base | Representation |
---|---|
bin | 11101001000100011101… |
… | …011101111111110100000 |
3 | 21002101122112201222000111 |
4 | 131020203223233332200 |
5 | 230300201134244300 |
6 | 4131421453101104 |
7 | 264433515244654 |
oct | 35104353577640 |
9 | 7071575658014 |
10 | 2002053431200 |
11 | 70207aa72069 |
12 | 284017787794 |
13 | 116a3cac8814 |
14 | 6cc85496a64 |
15 | 371283e69ba |
hex | 1d223aeffa0 |
2002053431200 has 72 divisors (see below), whose sum is σ = 4935904355340. Its totient is φ = 792892416000.
The previous prime is 2002053431179. The next prime is 2002053431207. The reversal of 2002053431200 is 21343502002.
It can be written as a sum of positive squares in 6 ways, for example, as 1267542725904 + 734510705296 = 1125852^2 + 857036^2 .
It is not an unprimeable number, because it can be changed into a prime (2002053431207) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 12308145 + ... + 12469744.
Almost surely, 22002053431200 is an apocalyptic number.
2002053431200 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
2002053431200 is an abundant number, since it is smaller than the sum of its proper divisors (2933850924140).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
2002053431200 is a wasteful number, since it uses less digits than its factorization.
2002053431200 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 24778010 (or 24777997 counting only the distinct ones).
The product of its (nonzero) digits is 1440, while the sum is 22.
Adding to 2002053431200 its reverse (21343502002), we get a palindrome (2023396933202).
The spelling of 2002053431200 in words is "two trillion, two billion, fifty-three million, four hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •