Base | Representation |
---|---|
bin | 110000000001100101… |
… | …0100000001110101001 |
3 | 100212012110121200100021 |
4 | 1200003022200032221 |
5 | 3142203332101301 |
6 | 115213415040441 |
7 | 10310500042030 |
oct | 1400312401651 |
9 | 325173550307 |
10 | 103132300201 |
11 | 3a813549657 |
12 | 17ba2970121 |
13 | 9957736708 |
14 | 4dc5065717 |
15 | 2a392138a1 |
hex | 18032a03a9 |
103132300201 has 8 divisors (see below), whose sum is σ = 117924820160. Its totient is φ = 88354613808.
The previous prime is 103132300189. The next prime is 103132300213. The reversal of 103132300201 is 102003231301.
It is an interprime number because it is at equal distance from previous prime (103132300189) and next prime (103132300213).
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 103132300201 - 25 = 103132300169 is a prime.
It is not an unprimeable number, because it can be changed into a prime (103132300801) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3693486 + ... + 3721303.
It is an arithmetic number, because the mean of its divisors is an integer number (14740602520).
Almost surely, 2103132300201 is an apocalyptic number.
It is an amenable number.
103132300201 is a deficient number, since it is larger than the sum of its proper divisors (14792519959).
103132300201 is an equidigital number, since it uses as much as digits as its factorization.
103132300201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7416783.
The product of its (nonzero) digits is 108, while the sum is 16.
Adding to 103132300201 its reverse (102003231301), we get a palindrome (205135531502).
The spelling of 103132300201 in words is "one hundred three billion, one hundred thirty-two million, three hundred thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •