Base | Representation |
---|---|
bin | 10111001111010111011011… |
… | …100110101101010010110011 |
3 | 111101220021111210120222000220 |
4 | 113033113123212231102303 |
5 | 101344111132400201321 |
6 | 1001215032254144123 |
7 | 30346334246330652 |
oct | 2717273346552263 |
9 | 441807453528026 |
10 | 102211021100211 |
11 | 2a6274a5858941 |
12 | b5692201b2043 |
13 | 45055c5100c4a |
14 | 1b3507b387199 |
15 | bc3b2357c9c6 |
hex | 5cf5db9ad4b3 |
102211021100211 has 8 divisors (see below), whose sum is σ = 136309747522704. Its totient is φ = 68126487705600.
The previous prime is 102211021100207. The next prime is 102211021100219. The reversal of 102211021100211 is 112001120112201.
It is a happy number.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102211021100211 - 22 = 102211021100207 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102211021100219) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 3548240166 + ... + 3548268971.
It is an arithmetic number, because the mean of its divisors is an integer number (17038718440338).
Almost surely, 2102211021100211 is an apocalyptic number.
102211021100211 is a deficient number, since it is larger than the sum of its proper divisors (34098726422493).
102211021100211 is an equidigital number, since it uses as much as digits as its factorization.
102211021100211 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 7096513941.
The product of its (nonzero) digits is 16, while the sum is 15.
Adding to 102211021100211 its reverse (112001120112201), we get a palindrome (214212141212412).
The spelling of 102211021100211 in words is "one hundred two trillion, two hundred eleven billion, twenty-one million, one hundred thousand, two hundred eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •