Base | Representation |
---|---|
bin | 111101100001011111… |
… | …0001110101110001101 |
3 | 110122000200022002112222 |
4 | 1323002332032232031 |
5 | 4131040222041023 |
6 | 140410052305125 |
7 | 12355026264641 |
oct | 1730276165615 |
9 | 418020262488 |
10 | 132120112013 |
11 | 510393a471a |
12 | 217329121a5 |
13 | c5c71b4a96 |
14 | 6574cacc21 |
15 | 368404ecc8 |
hex | 1ec2f8eb8d |
132120112013 has 4 divisors (see below), whose sum is σ = 132186875040. Its totient is φ = 132053348988.
The previous prime is 132120111973. The next prime is 132120112093. The reversal of 132120112013 is 310211021231.
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 132120112013 - 222 = 132115917709 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 132120111982 and 132120112000.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132120112093) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 33378545 + ... + 33382502.
It is an arithmetic number, because the mean of its divisors is an integer number (33046718760).
Almost surely, 2132120112013 is an apocalyptic number.
It is an amenable number.
132120112013 is a deficient number, since it is larger than the sum of its proper divisors (66763027).
132120112013 is an equidigital number, since it uses as much as digits as its factorization.
132120112013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 66763026.
The product of its (nonzero) digits is 72, while the sum is 17.
Adding to 132120112013 its reverse (310211021231), we get a palindrome (442331133244).
The spelling of 132120112013 in words is "one hundred thirty-two billion, one hundred twenty million, one hundred twelve thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •