Base | Representation |
---|---|
bin | 10111001101110001111010… |
… | …001010110101001011000101 |
3 | 111101111212010210011002112220 |
4 | 113031301322022311023011 |
5 | 101340314410112020401 |
6 | 1001053003351402553 |
7 | 30335425021204605 |
oct | 2715617212651305 |
9 | 441455123132486 |
10 | 102102012220101 |
11 | 2a595247116883 |
12 | b550079383459 |
13 | 44c824205231a |
14 | 1b2da99a7cc05 |
15 | bc0d934b0336 |
hex | 5cdc7a2b52c5 |
102102012220101 has 4 divisors (see below), whose sum is σ = 136136016293472. Its totient is φ = 68068008146732.
The previous prime is 102102012220097. The next prime is 102102012220147. The reversal of 102102012220101 is 101022210201201.
It is a semiprime because it is the product of two primes, and also a Blum integer, because the two primes are equal to 3 mod 4.
It is a cyclic number.
It is not a de Polignac number, because 102102012220101 - 22 = 102102012220097 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102102012228101) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 17017002036681 + ... + 17017002036686.
It is an arithmetic number, because the mean of its divisors is an integer number (34034004073368).
Almost surely, 2102102012220101 is an apocalyptic number.
It is an amenable number.
102102012220101 is a deficient number, since it is larger than the sum of its proper divisors (34034004073371).
102102012220101 is an equidigital number, since it uses as much as digits as its factorization.
102102012220101 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34034004073370.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102102012220101 its reverse (101022210201201), we get a palindrome (203124222421302).
The spelling of 102102012220101 in words is "one hundred two trillion, one hundred two billion, twelve million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.062 sec. • engine limits •