Base | Representation |
---|---|
bin | 10111001100010100110001… |
… | …101101000110101001110101 |
3 | 111101011022000121111202012020 |
4 | 113030110301231012221311 |
5 | 101332200110112020041 |
6 | 1000535024424343353 |
7 | 30325254644216064 |
oct | 2714246155065165 |
9 | 441138017452166 |
10 | 102002012220021 |
11 | 2a5568a0790711 |
12 | b53480b614b59 |
13 | 44bb996542844 |
14 | 1b28cd0a1c1db |
15 | bbd48e275866 |
hex | 5cc531b46a75 |
102002012220021 has 4 divisors (see below), whose sum is σ = 136002682960032. Its totient is φ = 68001341480012.
The previous prime is 102002012220007. The next prime is 102002012220047. The reversal of 102002012220021 is 120022210200201.
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 102002012220021 - 27 = 102002012219893 is a prime.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102002012200021) 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, 17000335370001 + ... + 17000335370006.
It is an arithmetic number, because the mean of its divisors is an integer number (34000670740008).
Almost surely, 2102002012220021 is an apocalyptic number.
It is an amenable number.
102002012220021 is a deficient number, since it is larger than the sum of its proper divisors (34000670740011).
102002012220021 is an equidigital number, since it uses as much as digits as its factorization.
102002012220021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 34000670740010.
The product of its (nonzero) digits is 64, while the sum is 15.
Adding to 102002012220021 its reverse (120022210200201), we get a palindrome (222024222420222).
The spelling of 102002012220021 in words is "one hundred two trillion, two billion, twelve million, two hundred twenty thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •