Base | Representation |
---|---|
bin | 10111001100011101001111… |
… | …011000010001011000100101 |
3 | 111101012011110221210022110001 |
4 | 113030131033120101120211 |
5 | 101332322213100310041 |
6 | 1000543130303301301 |
7 | 30326026104156466 |
oct | 2714351730213045 |
9 | 441164427708401 |
10 | 102011100010021 |
11 | 2a55a734593864 |
12 | b536526baa831 |
13 | 44bc7b424cb87 |
14 | 1b29513966d6d |
15 | bbd821ee4131 |
hex | 5cc74f611625 |
102011100010021 has 8 divisors (see below), whose sum is σ = 106459961834880. Its totient is φ = 97563371235792.
The previous prime is 102011100010019. The next prime is 102011100010051. The reversal of 102011100010021 is 120010001110201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 102011100010021 - 21 = 102011100010019 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102011100010051) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 283078665 + ... + 283438798.
It is an arithmetic number, because the mean of its divisors is an integer number (13307495229360).
Almost surely, 2102011100010021 is an apocalyptic number.
It is an amenable number.
102011100010021 is a deficient number, since it is larger than the sum of its proper divisors (4448861824859).
102011100010021 is an equidigital number, since it uses as much as digits as its factorization.
102011100010021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 566525315.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102011100010021 its reverse (120010001110201), we get a palindrome (222021101120222).
The spelling of 102011100010021 in words is "one hundred two trillion, eleven billion, one hundred million, ten thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.316 sec. • engine limits •