Base | Representation |
---|---|
bin | 11110000011110000111101… |
… | …001100010010010111010011 |
3 | 122100002012121122221120000221 |
4 | 132003300331030102113103 |
5 | 114311431321210031003 |
6 | 1145055521405053511 |
7 | 36563100133153564 |
oct | 3603607514222723 |
9 | 570065548846027 |
10 | 132200120002003 |
11 | 39139835322519 |
12 | 129b1328857297 |
13 | 589c557c63511 |
14 | 249073ca4a16b |
15 | 1043c663017bd |
hex | 783c3d3125d3 |
132200120002003 has 4 divisors (see below), whose sum is σ = 139158021054760. Its totient is φ = 125242218949248.
The previous prime is 132200120002001. The next prime is 132200120002019. The reversal of 132200120002003 is 300200021002231.
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 132200120002003 - 21 = 132200120002001 is a prime.
It is a super-3 number, since 3×1322001200020033 (a number of 43 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (132200120002001) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 3478950526350 + ... + 3478950526387.
It is an arithmetic number, because the mean of its divisors is an integer number (34789505263690).
Almost surely, 2132200120002003 is an apocalyptic number.
132200120002003 is a deficient number, since it is larger than the sum of its proper divisors (6957901052757).
132200120002003 is an equidigital number, since it uses as much as digits as its factorization.
132200120002003 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6957901052756.
The product of its (nonzero) digits is 144, while the sum is 16.
Adding to 132200120002003 its reverse (300200021002231), we get a palindrome (432400141004234).
The spelling of 132200120002003 in words is "one hundred thirty-two trillion, two hundred billion, one hundred twenty million, two thousand, three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.078 sec. • engine limits •