Base | Representation |
---|---|
bin | 101101100000001000100100… |
… | …100110000000000000111100 |
3 | 222020120022112012012000102110 |
4 | 231200020210212000000330 |
5 | 202212232403423144012 |
6 | 1545342001135254020 |
7 | 60103134042463032 |
oct | 5540104446000074 |
9 | 866508465160373 |
10 | 200120320131132 |
11 | 58845607651755 |
12 | 1a5407aa37a310 |
13 | 878835a8a204b |
14 | 375bc376a0552 |
15 | 18208c71cd73c |
hex | b6022498003c |
200120320131132 has 12 divisors (see below), whose sum is σ = 466947413639336. Its totient is φ = 66706773377040.
The previous prime is 200120320131119. The next prime is 200120320131139. The reversal of 200120320131132 is 231131023021002.
It is a tau number, because it is divible by the number of its divisors (12).
It is a junction number, because it is equal to n+sod(n) for n = 200120320131099 and 200120320131108.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (200120320131139) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 8338346672119 + ... + 8338346672142.
Almost surely, 2200120320131132 is an apocalyptic number.
It is an amenable number.
200120320131132 is an abundant number, since it is smaller than the sum of its proper divisors (266827093508204).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
200120320131132 is a wasteful number, since it uses less digits than its factorization.
200120320131132 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 16676693344268 (or 16676693344266 counting only the distinct ones).
The product of its (nonzero) digits is 432, while the sum is 21.
Adding to 200120320131132 its reverse (231131023021002), we get a palindrome (431251343152134).
The spelling of 200120320131132 in words is "two hundred trillion, one hundred twenty billion, three hundred twenty million, one hundred thirty-one thousand, one hundred thirty-two".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •