Base | Representation |
---|---|
bin | 101101100011001101111010… |
… | …011001111100101110111000 |
3 | 222021022120110101101201002212 |
4 | 231203031322121330232320 |
5 | 202224220333040210130 |
6 | 1550023203115314252 |
7 | 60124344666104342 |
oct | 5543157231745670 |
9 | 867276411351085 |
10 | 200332213210040 |
11 | 5891746178608a |
12 | 1a575884a4b988 |
13 | 87a2328b5ac02 |
14 | 37681b90ca292 |
15 | 1826179802e95 |
hex | b6337a67cbb8 |
200332213210040 has 32 divisors (see below), whose sum is σ = 451009086076080. Its totient is φ = 80086377487872.
The previous prime is 200332213210009. The next prime is 200332213210049. The reversal of 200332213210040 is 40012312233002.
It is a junction number, because it is equal to n+sod(n) for n = 200332213209988 and 200332213210015.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200332213210049) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1453298849 + ... + 1453436688.
Almost surely, 2200332213210040 is an apocalyptic number.
200332213210040 is a gapful number since it is divisible by the number (20) formed by its first and last digit.
It is an amenable number.
200332213210040 is an abundant number, since it is smaller than the sum of its proper divisors (250676872866040).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200332213210040 is a wasteful number, since it uses less digits than its factorization.
200332213210040 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 2906737271 (or 2906737267 counting only the distinct ones).
The product of its (nonzero) digits is 1728, while the sum is 23.
Adding to 200332213210040 its reverse (40012312233002), we get a palindrome (240344525443042).
The spelling of 200332213210040 in words is "two hundred trillion, three hundred thirty-two billion, two hundred thirteen million, two hundred ten thousand, forty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •