Base | Representation |
---|---|
bin | 11110000011110001000011… |
… | …111100001110001101100000 |
3 | 122100002012220120000012021220 |
4 | 132003301003330032031200 |
5 | 114311432034201344300 |
6 | 1145055540532015040 |
7 | 36563103006455061 |
oct | 3603610374161540 |
9 | 570065816005256 |
10 | 132200233231200 |
11 | 3913989322a272 |
12 | 129b135a761480 |
13 | 589c575559644 |
14 | 249074dac2568 |
15 | 1043c7121ada0 |
hex | 783c43f0e360 |
132200233231200 has 144 divisors (see below), whose sum is σ = 431686559573136. Its totient is φ = 35140764672000.
The previous prime is 132200233231181. The next prime is 132200233231217. The reversal of 132200233231200 is 2132332002231.
It is a Harshad number since it is a multiple of its sum of digits (24).
It is a congruent number.
It is an unprimeable number.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 87241501 + ... + 88743900.
It is an arithmetic number, because the mean of its divisors is an integer number (2997823330369).
Almost surely, 2132200233231200 is an apocalyptic number.
132200233231200 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
132200233231200 is an abundant number, since it is smaller than the sum of its proper divisors (299486326341936).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132200233231200 is a wasteful number, since it uses less digits than its factorization.
132200233231200 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 175985737 (or 175985724 counting only the distinct ones).
The product of its (nonzero) digits is 2592, while the sum is 24.
Adding to 132200233231200 its reverse (2132332002231), we get a palindrome (134332565233431).
The spelling of 132200233231200 in words is "one hundred thirty-two trillion, two hundred billion, two hundred thirty-three million, two hundred thirty-one thousand, two hundred".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.081 sec. • engine limits •