Base | Representation |
---|---|
bin | 101101101100111101101100… |
… | …110011110100101101111111 |
3 | 222100200121021222102112011000 |
4 | 231230331230303310231333 |
5 | 202321204044000310421 |
6 | 1551255013303101343 |
7 | 60223625640010026 |
oct | 5554755463645577 |
9 | 870617258375130 |
10 | 201002000010111 |
11 | 59055518992463 |
12 | 1a66364b141853 |
13 | 882053aa06551 |
14 | 378c7979298bd |
15 | 18387cb1bb226 |
hex | b6cf6ccf4b7f |
201002000010111 has 32 divisors (see below), whose sum is σ = 298237511174400. Its totient is φ = 133795925664480.
The previous prime is 201002000010101. The next prime is 201002000010139. The reversal of 201002000010111 is 111010000200102.
It is a happy number.
It is not a de Polignac number, because 201002000010111 - 214 = 201001999993727 is a prime.
It is a Harshad number since it is a multiple of its sum of digits (9).
It is a junction number, because it is equal to n+sod(n) for n = 201002000010093 and 201002000010102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201002000010101) 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, 50163925 + ... + 54022433.
It is an arithmetic number, because the mean of its divisors is an integer number (9319922224200).
Almost surely, 2201002000010111 is an apocalyptic number.
201002000010111 is a deficient number, since it is larger than the sum of its proper divisors (97235511164289).
201002000010111 is a wasteful number, since it uses less digits than its factorization.
201002000010111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 3861476 (or 3861470 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201002000010111 its reverse (111010000200102), we get a palindrome (312012000210213).
The spelling of 201002000010111 in words is "two hundred one trillion, two billion, ten thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •