Base | Representation |
---|---|
bin | 11101000111000011000… |
… | …011011100010010000100 |
3 | 21002020110120012112021202 |
4 | 131013003003130102010 |
5 | 230233341124031121 |
6 | 4130552541402032 |
7 | 264345401405051 |
oct | 35070303342204 |
9 | 7066416175252 |
10 | 2000432252036 |
11 | 701418945179 |
12 | 283844869318 |
13 | 116841c889ca |
14 | 6cb7004c028 |
15 | 37080e1240b |
hex | 1d1c30dc484 |
2000432252036 has 12 divisors (see below), whose sum is σ = 3621472180620. Its totient is φ = 965725914720.
The previous prime is 2000432252003. The next prime is 2000432252047. The reversal of 2000432252036 is 6302522340002.
It can be written as a sum of positive squares in 2 ways, for example, as 1442040722500 + 558391529536 = 1200850^2 + 747256^2 .
It is a super-2 number, since 2×20004322520362 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (29).
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 3 ways as a sum of consecutive naturals, for example, 8622552695 + ... + 8622552926.
It is an arithmetic number, because the mean of its divisors is an integer number (301789348385).
Almost surely, 22000432252036 is an apocalyptic number.
It is an amenable number.
2000432252036 is a deficient number, since it is larger than the sum of its proper divisors (1621039928584).
2000432252036 is a wasteful number, since it uses less digits than its factorization.
2000432252036 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 17245105654 (or 17245105652 counting only the distinct ones).
The product of its (nonzero) digits is 17280, while the sum is 29.
Adding to 2000432252036 its reverse (6302522340002), we get a palindrome (8302954592038).
The spelling of 2000432252036 in words is "two trillion, four hundred thirty-two million, two hundred fifty-two thousand, thirty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •