Base | Representation |
---|---|
bin | 10111001101111010011111… |
… | …000011111011000111010011 |
3 | 111101112201220120021201022020 |
4 | 113031322133003323013103 |
5 | 101340442240100213021 |
6 | 1001101125233542523 |
7 | 30336202151332113 |
oct | 2715723703730723 |
9 | 441481816251266 |
10 | 102111221101011 |
11 | 2a599142306361 |
12 | b551a09414a43 |
13 | 44c907bb78c95 |
14 | 1b302d0b09043 |
15 | bc1231b9c7c6 |
hex | 5cde9f0fb1d3 |
102111221101011 has 8 divisors (see below), whose sum is σ = 138455893018560. Its totient is φ = 66920348292072.
The previous prime is 102111221101009. The next prime is 102111221101037. The reversal of 102111221101011 is 110101122111201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102111221101011 - 21 = 102111221101009 is a prime.
It is not an unprimeable number, because it can be changed into a prime (102111221101051) 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, 288449776945 + ... + 288449777298.
It is an arithmetic number, because the mean of its divisors is an integer number (17306986627320).
Almost surely, 2102111221101011 is an apocalyptic number.
102111221101011 is a deficient number, since it is larger than the sum of its proper divisors (36344671917549).
102111221101011 is an equidigital number, since it uses as much as digits as its factorization.
102111221101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 576899554305.
The product of its (nonzero) digits is 8, while the sum is 15.
Adding to 102111221101011 its reverse (110101122111201), we get a palindrome (212212343212212).
The spelling of 102111221101011 in words is "one hundred two trillion, one hundred eleven billion, two hundred twenty-one million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.079 sec. • engine limits •