Base | Representation |
---|---|
bin | 10111001100010100111110… |
… | …001001111010111111011101 |
3 | 111101011022120011120000001120 |
4 | 113030110332021322333131 |
5 | 101332201022100213041 |
6 | 1000535101245401153 |
7 | 30325263061532433 |
oct | 2714247611727735 |
9 | 441138504500046 |
10 | 102002221101021 |
11 | 2a55699868a03a |
12 | b5348695691b9 |
13 | 44bb9ca8b9277 |
14 | 1b28d10672d53 |
15 | bbd4a2786366 |
hex | 5cc53e27afdd |
102002221101021 has 8 divisors (see below), whose sum is σ = 138032856415584. Its totient is φ = 66986533260240.
The previous prime is 102002221100999. The next prime is 102002221101031. The reversal of 102002221101021 is 120101122200201.
It is a sphenic number, since it is the product of 3 distinct primes.
It is a de Polignac number, because none of the positive numbers 2k-102002221101021 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002221101031) 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, 253736868210 + ... + 253736868611.
It is an arithmetic number, because the mean of its divisors is an integer number (17254107051948).
Almost surely, 2102002221101021 is an apocalyptic number.
It is an amenable number.
102002221101021 is a deficient number, since it is larger than the sum of its proper divisors (36030635314563).
102002221101021 is an equidigital number, since it uses as much as digits as its factorization.
102002221101021 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 507473736891.
The product of its (nonzero) digits is 32, while the sum is 15.
Adding to 102002221101021 its reverse (120101122200201), we get a palindrome (222103343301222).
The spelling of 102002221101021 in words is "one hundred two trillion, two billion, two hundred twenty-one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.075 sec. • engine limits •