Base | Representation |
---|---|
bin | 111101100000111100… |
… | …1001001100110100110 |
3 | 110121222102020001210212 |
4 | 1323001321021212212 |
5 | 4131021103044420 |
6 | 140404204215422 |
7 | 12354416333210 |
oct | 1730171114646 |
9 | 417872201725 |
10 | 132102003110 |
11 | 5102a156190 |
12 | 2172883a572 |
13 | c5c351435c |
14 | 65727175b0 |
15 | 36826743c5 |
hex | 1ec1e499a6 |
132102003110 has 32 divisors (see below), whose sum is σ = 296457484032. Its totient is φ = 41174650080.
The previous prime is 132102003107. The next prime is 132102003127. The reversal of 132102003110 is 11300201231.
It is a Harshad number since it is a multiple of its sum of digits (14).
It is a Curzon number.
It is a congruent number.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 85779752 + ... + 85781291.
It is an arithmetic number, because the mean of its divisors is an integer number (9264296376).
Almost surely, 2132102003110 is an apocalyptic number.
132102003110 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
132102003110 is an abundant number, since it is smaller than the sum of its proper divisors (164355480922).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
132102003110 is a wasteful number, since it uses less digits than its factorization.
132102003110 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 171561068.
The product of its (nonzero) digits is 36, while the sum is 14.
Adding to 132102003110 its reverse (11300201231), we get a palindrome (143402204341).
The spelling of 132102003110 in words is "one hundred thirty-two billion, one hundred two million, three thousand, one hundred ten".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •