Base | Representation |
---|---|
bin | 101101101100111011110110… |
… | …110010101100000101010111 |
3 | 222100200102011222200122102100 |
4 | 231230323312302230011113 |
5 | 202321141020110013421 |
6 | 1551254045012413143 |
7 | 60223525605136032 |
oct | 5554736662540527 |
9 | 870612158618370 |
10 | 201000020001111 |
11 | 590546a225a391 |
12 | 1a6631980171b3 |
13 | 88202b373b4a6 |
14 | 378c64a996019 |
15 | 1838712456c26 |
hex | b6cef6cac157 |
201000020001111 has 24 divisors (see below), whose sum is σ = 298364386198320. Its totient is φ = 130297860804096.
The previous prime is 201000020001101. The next prime is 201000020001127. The reversal of 201000020001111 is 111100020000102.
It is a happy number.
It is not a de Polignac number, because 201000020001111 - 245 = 165815647912279 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 = 201000020001093 and 201000020001102.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (201000020001101) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 185873370 + ... + 186951623.
It is an arithmetic number, because the mean of its divisors is an integer number (12431849424930).
Almost surely, 2201000020001111 is an apocalyptic number.
201000020001111 is a deficient number, since it is larger than the sum of its proper divisors (97364366197209).
201000020001111 is a wasteful number, since it uses less digits than its factorization.
201000020001111 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 372826655 (or 372826652 counting only the distinct ones).
The product of its (nonzero) digits is 4, while the sum is 9.
Adding to 201000020001111 its reverse (111100020000102), we get a palindrome (312100040001213).
The spelling of 201000020001111 in words is "two hundred one trillion, twenty million, one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •