Base | Representation |
---|---|
bin | 110000000000000100011100… |
… | …111000101011010111000001 |
3 | 1000200111000102102011201212212 |
4 | 300000010130320223113001 |
5 | 210132320323100320001 |
6 | 2024555020552031505 |
7 | 62316160453121600 |
oct | 6000043470532701 |
9 | 1020430372151785 |
10 | 211111012120001 |
11 | 612a274a764084 |
12 | 1b81688a992595 |
13 | 90a48b57a17b6 |
14 | 3a1bb82963a37 |
15 | 19617366187bb |
hex | c0011ce2b5c1 |
211111012120001 has 12 divisors (see below), whose sum is σ = 245587963133952. Its totient is φ = 180945040422888.
The previous prime is 211111012119991. The next prime is 211111012120051. The reversal of 211111012120001 is 100021210111112.
It is not a de Polignac number, because 211111012120001 - 234 = 211093832250817 is a prime.
It is a super-3 number, since 3×2111110121200013 (a number of 44 digits) contains 333 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (211111012120051) by changing a digit.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 85142465 + ... + 87586878.
It is an arithmetic number, because the mean of its divisors is an integer number (20465663594496).
Almost surely, 2211111012120001 is an apocalyptic number.
It is an amenable number.
211111012120001 is a deficient number, since it is larger than the sum of its proper divisors (34476951013951).
211111012120001 is a wasteful number, since it uses less digits than its factorization.
211111012120001 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 172754300 (or 172754293 counting only the distinct ones).
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 211111012120001 its reverse (100021210111112), we get a palindrome (311132222231113).
The spelling of 211111012120001 in words is "two hundred eleven trillion, one hundred eleven billion, twelve million, one hundred twenty thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •