Base | Representation |
---|---|
bin | 10111001101110010000000… |
… | …000000001101111000010011 |
3 | 111101111212101121022221220210 |
4 | 113031302000000031320103 |
5 | 101340320110141213021 |
6 | 1001053021205335203 |
7 | 30335430320162646 |
oct | 2715620000157023 |
9 | 441455347287823 |
10 | 102102110101011 |
11 | 2a5952973a0199 |
12 | b5500a6107503 |
13 | 44c8259403417 |
14 | 1b2daa8a7ba5d |
15 | bc0d9bd96e76 |
hex | 5cdc8000de13 |
102102110101011 has 4 divisors (see below), whose sum is σ = 136136146801352. Its totient is φ = 68068073400672.
The previous prime is 102102110100943. The next prime is 102102110101021. The reversal of 102102110101011 is 110101011201201.
It is a semiprime because it is the product of two primes.
It is not a de Polignac number, because 102102110101011 - 221 = 102102108003859 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102102110101021) 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 3 ways as a sum of consecutive naturals, for example, 17017018350166 + ... + 17017018350171.
It is an arithmetic number, because the mean of its divisors is an integer number (34034036700338).
Almost surely, 2102102110101011 is an apocalyptic number.
102102110101011 is a deficient number, since it is larger than the sum of its proper divisors (34034036700341).
102102110101011 is an equidigital number, since it uses as much as digits as its factorization.
102102110101011 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34034036700340.
The product of its (nonzero) digits is 4, while the sum is 12.
Adding to 102102110101011 its reverse (110101011201201), we get a palindrome (212203121302212).
The spelling of 102102110101011 in words is "one hundred two trillion, one hundred two billion, one hundred ten million, one hundred one thousand, eleven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •