Base | Representation |
---|---|
bin | 10111001100010011110111… |
… | …010010101000001111111011 |
3 | 111101011012111022102122010021 |
4 | 113030103313102220033323 |
5 | 101332141103220414321 |
6 | 1000534343255231311 |
7 | 30325221444205303 |
oct | 2714236722501773 |
9 | 441135438378107 |
10 | 102001032201211 |
11 | 2a556438575010 |
12 | b534597378537 |
13 | 44bb86b4b0360 |
14 | 1b28c3a7d2603 |
15 | bbd4331de941 |
hex | 5cc4f74a83fb |
102001032201211 has 16 divisors (see below), whose sum is σ = 119972883985920. Its totient is φ = 85495626421920.
The previous prime is 102001032201113. The next prime is 102001032201241. The reversal of 102001032201211 is 112102230100201.
It is not a de Polignac number, because 102001032201211 - 211 = 102001032199163 is a prime.
It is a super-2 number, since 2×1020010322012112 (a number of 29 digits) contains 22 as substring.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102001032201241) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 415065715 + ... + 415311388.
It is an arithmetic number, because the mean of its divisors is an integer number (7498305249120).
Almost surely, 2102001032201211 is an apocalyptic number.
102001032201211 is a gapful number since it is divisible by the number (11) formed by its first and last digit.
102001032201211 is a deficient number, since it is larger than the sum of its proper divisors (17971851784709).
102001032201211 is a wasteful number, since it uses less digits than its factorization.
102001032201211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 830377986.
The product of its (nonzero) digits is 48, while the sum is 16.
Adding to 102001032201211 its reverse (112102230100201), we get a palindrome (214103262301412).
The spelling of 102001032201211 in words is "one hundred two trillion, one billion, thirty-two million, two hundred one thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.027 sec. • engine limits •