Base | Representation |
---|---|
bin | 111101100001001100… |
… | …0000011011010010101 |
3 | 110121222222110122102201 |
4 | 1323002120003122111 |
5 | 4131030141313323 |
6 | 140405054004501 |
7 | 12354545233453 |
oct | 1730230033225 |
9 | 417888418381 |
10 | 132110104213 |
11 | 5103378970a |
12 | 2172b4a6731 |
13 | c5c50bc7c9 |
14 | 65738259d3 |
15 | 36832248ad |
hex | 1ec2603695 |
132110104213 has 4 divisors (see below), whose sum is σ = 133392726688. Its totient is φ = 130827481740.
The previous prime is 132110104171. The next prime is 132110104219. The reversal of 132110104213 is 312401011231.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 132110104213 - 29 = 132110103701 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132110104219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 641311083 + ... + 641311288.
It is an arithmetic number, because the mean of its divisors is an integer number (33348181672).
Almost surely, 2132110104213 is an apocalyptic number.
It is an amenable number.
132110104213 is a deficient number, since it is larger than the sum of its proper divisors (1282622475).
132110104213 is a wasteful number, since it uses less digits than its factorization.
132110104213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1282622474.
The product of its (nonzero) digits is 144, while the sum is 19.
Adding to 132110104213 its reverse (312401011231), we get a palindrome (444511115444).
The spelling of 132110104213 in words is "one hundred thirty-two billion, one hundred ten million, one hundred four thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •