Base | Representation |
---|---|
bin | 10111001101110000111101… |
… | …111101111100111110001011 |
3 | 111101111202112101122022211020 |
4 | 113031300331331330332023 |
5 | 101340310323031224321 |
6 | 1001052315231403523 |
7 | 30335361005236353 |
oct | 2715607575747613 |
9 | 441452471568736 |
10 | 102101002211211 |
11 | 2a594878a87193 |
12 | b54ba370835a3 |
13 | 44c8110a1c523 |
14 | 1b2da01887b63 |
15 | bc0d349a34c6 |
hex | 5cdc3df7cf8b |
102101002211211 has 32 divisors (see below), whose sum is σ = 139834674524160. Its totient is φ = 66243205776384.
The previous prime is 102101002211203. The next prime is 102101002211261. The reversal of 102101002211211 is 112112200101201.
It is a happy number.
It is not a de Polignac number, because 102101002211211 - 23 = 102101002211203 is a prime.
It is a super-2 number, since 2×1021010022112112 (a number of 29 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (102101002211261) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (31) of ones.
It is a polite number, since it can be written in 31 ways as a sum of consecutive naturals, for example, 25523475 + ... + 29251491.
It is an arithmetic number, because the mean of its divisors is an integer number (4369833578880).
Almost surely, 2102101002211211 is an apocalyptic number.
102101002211211 is a deficient number, since it is larger than the sum of its proper divisors (37733672312949).
102101002211211 is a wasteful number, since it uses less digits than its factorization.
102101002211211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3729755.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102101002211211 its reverse (112112200101201), we get a palindrome (214213202312412).
The spelling of 102101002211211 in words is "one hundred two trillion, one hundred one billion, two million, two hundred eleven thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •