Base | Representation |
---|---|
bin | 1001010001110010001001… |
… | …0000101010010110010111 |
3 | 1100010012212201222121002221 |
4 | 2110130202100222112113 |
5 | 2314113344230333421 |
6 | 33410155242043211 |
7 | 2102002213226365 |
oct | 224344220522627 |
9 | 40105781877087 |
10 | 10201122121111 |
11 | 32832a9549439 |
12 | 11890671a9507 |
13 | 58cc66aa208c |
14 | 273a4626a635 |
15 | 12a54bb6c841 |
hex | 9472242a597 |
10201122121111 has 8 divisors (see below), whose sum is σ = 10966491866880. Its totient is φ = 9458599233528.
The previous prime is 10201122121067. The next prime is 10201122121129. The reversal of 10201122121111 is 11112122110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 10201122121111 - 211 = 10201122119063 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10201122121171) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 5711713621 + ... + 5711715406.
It is an arithmetic number, because the mean of its divisors is an integer number (1370811483360).
Almost surely, 210201122121111 is an apocalyptic number.
10201122121111 is a deficient number, since it is larger than the sum of its proper divisors (765369745769).
10201122121111 is a wasteful number, since it uses less digits than its factorization.
10201122121111 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 11423429093.
The product of its (nonzero) digits is 16, while the sum is 16.
Adding to 10201122121111 its reverse (11112122110201), we get a palindrome (21313244231312).
The spelling of 10201122121111 in words is "ten trillion, two hundred one billion, one hundred twenty-two million, one hundred twenty-one thousand, one hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •