Base | Representation |
---|---|
bin | 111101100011111000… |
… | …0001100110001101110 |
3 | 110122020021020002101020 |
4 | 1323013300030301232 |
5 | 4131221240220420 |
6 | 140422035355010 |
7 | 12360022115535 |
oct | 1730760146156 |
9 | 418207202336 |
10 | 132200320110 |
11 | 5107a6a8201 |
12 | 21755752a66 |
13 | c60a9b8ab1 |
14 | 65817cb31c |
15 | 368b0e5340 |
hex | 1ec7c0cc6e |
132200320110 has 16 divisors (see below), whose sum is σ = 317280768336. Its totient is φ = 35253418688.
The previous prime is 132200320079. The next prime is 132200320117. The reversal of 132200320110 is 11023002231.
It is a Harshad number since it is a multiple of its sum of digits (15).
It is a self number, because there is not a number n which added to its sum of digits gives 132200320110.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132200320117) 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, 2203338639 + ... + 2203338698.
It is an arithmetic number, because the mean of its divisors is an integer number (19830048021).
Almost surely, 2132200320110 is an apocalyptic number.
132200320110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132200320110 is an abundant number, since it is smaller than the sum of its proper divisors (185080448226).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132200320110 is a wasteful number, since it uses less digits than its factorization.
132200320110 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4406677347.
The product of its (nonzero) digits is 72, while the sum is 15.
Adding to 132200320110 its reverse (11023002231), we get a palindrome (143223322341).
The spelling of 132200320110 in words is "one hundred thirty-two billion, two hundred million, three hundred twenty thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •