Base | Representation |
---|---|
bin | 11110000010100000001110… |
… | …001101010101110100001101 |
3 | 122022202220212020221021010220 |
4 | 132002200032031111310031 |
5 | 114304021302143400323 |
6 | 1144552023433021553 |
7 | 36553611004552452 |
oct | 3602401615256415 |
9 | 568686766837126 |
10 | 132113432403213 |
11 | 39105aa0446498 |
12 | 129985752548b9 |
13 | 5894321476071 |
14 | 248a477a35829 |
15 | 1041890b770e3 |
hex | 78280e355d0d |
132113432403213 has 16 divisors (see below), whose sum is σ = 176236477724736. Its totient is φ = 88033005937280.
The previous prime is 132113432403167. The next prime is 132113432403221. The reversal of 132113432403213 is 312304234311231.
It is a cyclic number.
It is not a de Polignac number, because 132113432403213 - 214 = 132113432386829 is a prime.
It is a super-2 number, since 2×1321134324032132 (a number of 29 digits) contains 22 as substring.
It is a Curzon number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132113432403233) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 393295018 + ... + 393630788.
It is an arithmetic number, because the mean of its divisors is an integer number (11014779857796).
Almost surely, 2132113432403213 is an apocalyptic number.
It is an amenable number.
132113432403213 is a deficient number, since it is larger than the sum of its proper divisors (44123045321523).
132113432403213 is a wasteful number, since it uses less digits than its factorization.
132113432403213 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 398844.
The product of its (nonzero) digits is 31104, while the sum is 33.
Adding to 132113432403213 its reverse (312304234311231), we get a palindrome (444417666714444).
The spelling of 132113432403213 in words is "one hundred thirty-two trillion, one hundred thirteen billion, four hundred thirty-two million, four hundred three thousand, two hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •