Base | Representation |
---|---|
bin | 11110000011110010000101… |
… | …010100000100100001101111 |
3 | 122100002022201222202221000210 |
4 | 132003302011110010201233 |
5 | 114311441310440031111 |
6 | 1145100241431353503 |
7 | 36563142125041503 |
oct | 3603620524044157 |
9 | 570068658687023 |
10 | 132201330002031 |
11 | 3913a2a6339444 |
12 | 129b1605b22893 |
13 | 589c6bb849574 |
14 | 2490815620303 |
15 | 1043cd76650a6 |
hex | 783c8550486f |
132201330002031 has 32 divisors (see below), whose sum is σ = 188721853804800. Its totient is φ = 82066788748800.
The previous prime is 132201330002023. The next prime is 132201330002051. The reversal of 132201330002031 is 130200033102231.
It is not a de Polignac number, because 132201330002031 - 23 = 132201330002023 is a prime.
It is a super-2 number, since 2×1322013300020312 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 132201330001989 and 132201330002007.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (132201330002051) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 17046631 + ... + 23558231.
It is an arithmetic number, because the mean of its divisors is an integer number (5897557931400).
Almost surely, 2132201330002031 is an apocalyptic number.
132201330002031 is a deficient number, since it is larger than the sum of its proper divisors (56520523802769).
132201330002031 is a wasteful number, since it uses less digits than its factorization.
132201330002031 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 6517719.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 132201330002031 its reverse (130200033102231), we get a palindrome (262401363104262).
The spelling of 132201330002031 in words is "one hundred thirty-two trillion, two hundred one billion, three hundred thirty million, two thousand, thirty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.084 sec. • engine limits •