Base | Representation |
---|---|
bin | 111101100001110100… |
… | …0001001110110010111 |
3 | 110122001102222110010100 |
4 | 1323003220021312113 |
5 | 4131101030231403 |
6 | 140411124025143 |
7 | 12355221560010 |
oct | 1730350116627 |
9 | 418042873110 |
10 | 132131102103 |
11 | 51044620740 |
12 | 217365321b3 |
13 | c5c95621b0 |
14 | 6576530007 |
15 | 3684ec12a3 |
hex | 1ec3a09d97 |
132131102103 has 48 divisors (see below), whose sum is σ = 256254276096. Its totient is φ = 63359565120.
The previous prime is 132131102099. The next prime is 132131102111. The reversal of 132131102103 is 301201131231.
It is not a de Polignac number, because 132131102103 - 22 = 132131102099 is a prime.
It is a super-3 number, since 3×1321311021033 (a number of 34 digits) contains 333 as substring. Note that it is a super-d number also for d = 2.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132131102183) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 7324275 + ... + 7342292.
It is an arithmetic number, because the mean of its divisors is an integer number (5338630752).
Almost surely, 2132131102103 is an apocalyptic number.
132131102103 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
132131102103 is a deficient number, since it is larger than the sum of its proper divisors (124123173993).
132131102103 is a wasteful number, since it uses less digits than its factorization.
132131102103 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 14666604 (or 14666601 counting only the distinct ones).
The product of its (nonzero) digits is 108, while the sum is 18.
Adding to 132131102103 its reverse (301201131231), we get a palindrome (433332233334).
The spelling of 132131102103 in words is "one hundred thirty-two billion, one hundred thirty-one million, one hundred two thousand, one hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •