Base | Representation |
---|---|
bin | 101101101110110110110001… |
… | …100110010001000111100011 |
3 | 222101011000212010011220200210 |
4 | 231232312301212101013203 |
5 | 202330321320243300303 |
6 | 1551434433332345203 |
7 | 60236210352036114 |
oct | 5556666146210743 |
9 | 871130763156623 |
10 | 201132003103203 |
11 | 590a5670284467 |
12 | 1a684890a75203 |
13 | 882c888421bc3 |
14 | 3794bab59c20b |
15 | 183bd89441203 |
hex | b6edb19911e3 |
201132003103203 has 32 divisors (see below), whose sum is σ = 272526874401600. Its totient is φ = 131928082108416.
The previous prime is 201132003103117. The next prime is 201132003103217. The reversal of 201132003103203 is 302301300231102.
It is not a de Polignac number, because 201132003103203 - 222 = 201131998908899 is a prime.
It is a super-2 number, since 2×2011320031032032 (a number of 29 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 201132003103203.
It is not an unprimeable number, because it can be changed into a prime (201132003103103) by changing a digit.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 107725525 + ... + 109576697.
It is an arithmetic number, because the mean of its divisors is an integer number (8516464825050).
Almost surely, 2201132003103203 is an apocalyptic number.
201132003103203 is a deficient number, since it is larger than the sum of its proper divisors (71394871298397).
201132003103203 is a wasteful number, since it uses less digits than its factorization.
201132003103203 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1853271.
The product of its (nonzero) digits is 648, while the sum is 21.
Adding to 201132003103203 its reverse (302301300231102), we get a palindrome (503433303334305).
The spelling of 201132003103203 in words is "two hundred one trillion, one hundred thirty-two billion, three million, one hundred three thousand, two hundred three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •