Base | Representation |
---|---|
bin | 11110000010100000000001… |
… | …101011111001110100111111 |
3 | 122022202220022121121111010101 |
4 | 132002200001223321310333 |
5 | 114304020334402424411 |
6 | 1144551550530021531 |
7 | 36553602544033420 |
oct | 3602400153716477 |
9 | 568686277544111 |
10 | 132113222311231 |
11 | 391059a28a0257 |
12 | 12998516a178a7 |
13 | 58942b9a97395 |
14 | 248a457b87647 |
15 | 104187c4c78c1 |
hex | 782801af9d3f |
132113222311231 has 64 divisors (see below), whose sum is σ = 154891543617792. Its totient is φ = 110356688535552.
The previous prime is 132113222311229. The next prime is 132113222311237.
132113222311231 is nontrivially palindromic in base 10.
It is a cyclic number.
It is not a de Polignac number, because 132113222311231 - 21 = 132113222311229 is a prime.
It is a super-2 number, since 2×1321132223112312 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 132113222311231.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132113222311237) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 35929620765 + ... + 35929624441.
It is an arithmetic number, because the mean of its divisors is an integer number (2420180369028).
Almost surely, 2132113222311231 is an apocalyptic number.
132113222311231 is a deficient number, since it is larger than the sum of its proper divisors (22778321306561).
132113222311231 is a wasteful number, since it uses less digits than its factorization.
132113222311231 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6148.
The product of its digits is 2592, while the sum is 28.
The spelling of 132113222311231 in words is "one hundred thirty-two trillion, one hundred thirteen billion, two hundred twenty-two million, three hundred eleven thousand, two hundred thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •