Base | Representation |
---|---|
bin | 111101100001010001… |
… | …1100001011111100101 |
3 | 110122000012010101222200 |
4 | 1323002203201133211 |
5 | 4131031424023023 |
6 | 140405242245113 |
7 | 12354612625602 |
oct | 1730243413745 |
9 | 418005111880 |
10 | 132113111013 |
11 | 51035452774 |
12 | 217304b6799 |
13 | c5c5903290 |
14 | 6573da96a9 |
15 | 368361a743 |
hex | 1ec28e17e5 |
132113111013 has 24 divisors (see below), whose sum is σ = 206552514168. Its totient is φ = 80887669632.
The previous prime is 132113110957. The next prime is 132113111017. The reversal of 132113111013 is 310111311231.
It can be written as a sum of positive squares in 4 ways, for example, as 20301120324 + 111811990689 = 142482^2 + 334383^2 .
It is not a de Polignac number, because 132113111013 - 220 = 132112062437 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132113111017) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 2842870 + ... + 2888967.
It is an arithmetic number, because the mean of its divisors is an integer number (8606354757).
Almost surely, 2132113111013 is an apocalyptic number.
132113111013 is a gapful number since it is divisible by the number (13) formed by its first and last digit.
It is an amenable number.
132113111013 is a deficient number, since it is larger than the sum of its proper divisors (74439403155).
132113111013 is a wasteful number, since it uses less digits than its factorization.
132113111013 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 5732053 (or 5732050 counting only the distinct ones).
The product of its (nonzero) digits is 54, while the sum is 18.
Adding to 132113111013 its reverse (310111311231), we get a palindrome (442224422244).
The spelling of 132113111013 in words is "one hundred thirty-two billion, one hundred thirteen million, one hundred eleven thousand, thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •