Base | Representation |
---|---|
bin | 110000000001100101… |
… | …0001000010011011001 |
3 | 100212012110102200220122 |
4 | 1200003022020103121 |
5 | 3142203320432301 |
6 | 115213413003025 |
7 | 10310466153230 |
oct | 1400312102331 |
9 | 325173380818 |
10 | 103132202201 |
11 | 3a813491a66 |
12 | 17ba2923475 |
13 | 9957700c22 |
14 | 4dc503bb17 |
15 | 2a391e481b |
hex | 18032884d9 |
103132202201 has 16 divisors (see below), whose sum is σ = 120634060800. Its totient is φ = 86323457808.
The previous prime is 103132202197. The next prime is 103132202203. The reversal of 103132202201 is 102202231301.
It is not a de Polignac number, because 103132202201 - 22 = 103132202197 is a prime.
It is a super-2 number, since 2×1031322022012 (a number of 23 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 103132202201.
It is not an unprimeable number, because it can be changed into a prime (103132202203) 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 15 ways as a sum of consecutive naturals, for example, 1359410 + ... + 1433268.
It is an arithmetic number, because the mean of its divisors is an integer number (7539628800).
Almost surely, 2103132202201 is an apocalyptic number.
It is an amenable number.
103132202201 is a deficient number, since it is larger than the sum of its proper divisors (17501858599).
103132202201 is an equidigital number, since it uses as much as digits as its factorization.
103132202201 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 78548.
The product of its (nonzero) digits is 144, while the sum is 17.
Adding to 103132202201 its reverse (102202231301), we get a palindrome (205334433502).
The spelling of 103132202201 in words is "one hundred three billion, one hundred thirty-two million, two hundred two thousand, two hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.063 sec. • engine limits •