Base | Representation |
---|---|
bin | 11110000010010100000000… |
… | …000111001101011010001011 |
3 | 122022201122222210201120121201 |
4 | 132002110000013031122023 |
5 | 114303312414104404003 |
6 | 1144542013424045031 |
7 | 36552634565563504 |
oct | 3602240007153213 |
9 | 568648883646551 |
10 | 132100311013003 |
11 | 3910047779a853 |
12 | 12995b12a63777 |
13 | 589300cbb1748 |
14 | 248999110bbab |
15 | 1041373c47b1d |
hex | 7825001cd68b |
132100311013003 has 4 divisors (see below), whose sum is σ = 132217942635688. Its totient is φ = 131982679390320.
The previous prime is 132100311012977. The next prime is 132100311013079. The reversal of 132100311013003 is 300310113001231.
It is a semiprime because it is the product of two primes.
It is a cyclic number.
It is not a de Polignac number, because 132100311013003 - 29 = 132100311012491 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132100311014003) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 58815809658 + ... + 58815811903.
It is an arithmetic number, because the mean of its divisors is an integer number (33054485658922).
Almost surely, 2132100311013003 is an apocalyptic number.
132100311013003 is a deficient number, since it is larger than the sum of its proper divisors (117631622685).
132100311013003 is a wasteful number, since it uses less digits than its factorization.
132100311013003 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 117631622684.
The product of its (nonzero) digits is 162, while the sum is 19.
Adding to 132100311013003 its reverse (300310113001231), we get a palindrome (432410424014234).
The spelling of 132100311013003 in words is "one hundred thirty-two trillion, one hundred billion, three hundred eleven million, thirteen thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •