Base | Representation |
---|---|
bin | 101101100011001101111001… |
… | …101100001000110111101100 |
3 | 222021022120102112210120222111 |
4 | 231203031321230020313230 |
5 | 202224220322001414012 |
6 | 1550023202010053404 |
7 | 60124344462040060 |
oct | 5543157154106754 |
9 | 867276375716874 |
10 | 200332201201132 |
11 | 58917455a23670 |
12 | 1a575880a1a264 |
13 | 87a2326514b50 |
14 | 37681b7681aa0 |
15 | 182617872eba7 |
hex | b63379b08dec |
200332201201132 has 96 divisors (see below), whose sum is σ = 470716390287360. Its totient is φ = 72046662693120.
The previous prime is 200332201201129. The next prime is 200332201201147. The reversal of 200332201201132 is 231102102233002.
It is a Harshad number since it is a multiple of its sum of digits (22).
It is an unprimeable number.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 388286358 + ... + 388801954.
It is an arithmetic number, because the mean of its divisors is an integer number (4903295732160).
Almost surely, 2200332201201132 is an apocalyptic number.
200332201201132 is a gapful number since it is divisible by the number (22) formed by its first and last digit.
It is an amenable number.
200332201201132 is an abundant number, since it is smaller than the sum of its proper divisors (270384189086228).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200332201201132 is a wasteful number, since it uses less digits than its factorization.
200332201201132 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 612671 (or 612669 counting only the distinct ones).
The product of its (nonzero) digits is 864, while the sum is 22.
Adding to 200332201201132 its reverse (231102102233002), we get a palindrome (431434303434134).
The spelling of 200332201201132 in words is "two hundred trillion, three hundred thirty-two billion, two hundred one million, two hundred one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •