Base | Representation |
---|---|
bin | 11110000010110000110011… |
… | …000110011010011010010001 |
3 | 122022211121210200112111100122 |
4 | 132002300303012122122101 |
5 | 114304314230142310301 |
6 | 1145004125531200025 |
7 | 36555111041132663 |
oct | 3602606306323221 |
9 | 568747720474318 |
10 | 132131231213201 |
11 | 391125a4402910 |
12 | 1299bb01ba6015 |
13 | 5895bc9ac37ac |
14 | 248b285850533 |
15 | 104208353d81b |
hex | 782c3319a691 |
132131231213201 has 16 divisors (see below), whose sum is σ = 149207405875200. Its totient is φ = 115920684037200.
The previous prime is 132131231213183. The next prime is 132131231213203. The reversal of 132131231213201 is 102312132131231.
It is a cyclic number.
It is not a de Polignac number, because 132131231213201 - 246 = 61762487035537 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132131231213203) 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, 539545571 + ... + 539790408.
It is an arithmetic number, because the mean of its divisors is an integer number (9325462867200).
Almost surely, 2132131231213201 is an apocalyptic number.
132131231213201 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
It is an amenable number.
132131231213201 is a deficient number, since it is larger than the sum of its proper divisors (17076174661999).
132131231213201 is a wasteful number, since it uses less digits than its factorization.
132131231213201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 1079336380.
The product of its (nonzero) digits is 1296, while the sum is 26.
Adding to 132131231213201 its reverse (102312132131231), we get a palindrome (234443363344432).
The spelling of 132131231213201 in words is "one hundred thirty-two trillion, one hundred thirty-one billion, two hundred thirty-one million, two hundred thirteen thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •