Base | Representation |
---|---|
bin | 101101101111110111111110… |
… | …011101011001010110101011 |
3 | 222101101201120011110102212111 |
4 | 231233313332131121112223 |
5 | 202332443210044200021 |
6 | 1551530532304223151 |
7 | 60244236265506406 |
oct | 5557677635312653 |
9 | 871351504412774 |
10 | 201202012100011 |
11 | 59122326560a0a |
12 | 1a69636a90aab7 |
13 | 88363646995c0 |
14 | 379832d476d3d |
15 | 183dad572c8e1 |
hex | b6fdfe7595ab |
201202012100011 has 8 divisors (see below), whose sum is σ = 216679272473664. Its totient is φ = 185724777800640.
The previous prime is 201202012099987. The next prime is 201202012100051. The reversal of 201202012100011 is 110001210202102.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 201202012100011 - 211 = 201202012097963 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (13).
It is a junction number, because it is equal to n+sod(n) for n = 201202012099964 and 201202012100000.
It is not an unprimeable number, because it can be changed into a prime (201202012100051) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 11315031 + ... + 23031151.
It is an arithmetic number, because the mean of its divisors is an integer number (27084909059208).
Almost surely, 2201202012100011 is an apocalyptic number.
201202012100011 is a deficient number, since it is larger than the sum of its proper divisors (15477260373653).
201202012100011 is a wasteful number, since it uses less digits than its factorization.
201202012100011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 13037141.
The product of its (nonzero) digits is 16, while the sum is 13.
Adding to 201202012100011 its reverse (110001210202102), we get a palindrome (311203222302113).
The spelling of 201202012100011 in words is "two hundred one trillion, two hundred two billion, twelve million, one hundred thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •