Base | Representation |
---|---|
bin | 11110000011110001111110… |
… | …111011111001100000000001 |
3 | 122100002022110112102202201212 |
4 | 132003301332323321200001 |
5 | 114311441101042031423 |
6 | 1145100223050135505 |
7 | 36563136355413416 |
oct | 3603617673714001 |
9 | 570068415382655 |
10 | 132201223002113 |
11 | 3913a2509a6861 |
12 | 129b1596121595 |
13 | 589c6a26248c5 |
14 | 249080532a10d |
15 | 1043ccd07b578 |
hex | 783c7eef9801 |
132201223002113 has 16 divisors (see below), whose sum is σ = 133249637498880. Its totient is φ = 131154224533200.
The previous prime is 132201223002067. The next prime is 132201223002119. The reversal of 132201223002113 is 311200322102231.
It is a cyclic number.
It is not a de Polignac number, because 132201223002113 - 212 = 132201222998017 is a prime.
It is a super-2 number, since 2×1322012230021132 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (132201223002119) 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, 1557630068 + ... + 1557714938.
It is an arithmetic number, because the mean of its divisors is an integer number (8328102343680).
Almost surely, 2132201223002113 is an apocalyptic number.
It is an amenable number.
132201223002113 is a deficient number, since it is larger than the sum of its proper divisors (1048414496767).
132201223002113 is a wasteful number, since it uses less digits than its factorization.
132201223002113 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 93068.
The product of its (nonzero) digits is 864, while the sum is 23.
Adding to 132201223002113 its reverse (311200322102231), we get a palindrome (443401545104344).
The spelling of 132201223002113 in words is "one hundred thirty-two trillion, two hundred one billion, two hundred twenty-three million, two thousand, one hundred thirteen".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.569 sec. • engine limits •