Base | Representation |
---|---|
bin | 10111001100010010111011… |
… | …000001101000000011011001 |
3 | 111101011002212211212221002201 |
4 | 113030102323001220003121 |
5 | 101332132020401023001 |
6 | 1000534055100130201 |
7 | 30325154416114366 |
oct | 2714227301500331 |
9 | 441132784787081 |
10 | 102000021111001 |
11 | 2a555a69866a72 |
12 | b534354836961 |
13 | 44bb739b8c320 |
14 | 1b28b823d946d |
15 | bbd3c456c501 |
hex | 5cc4bb0680d9 |
102000021111001 has 8 divisors (see below), whose sum is σ = 109853722719944. Its totient is φ = 94147397521920.
The previous prime is 102000021110993. The next prime is 102000021111011. The reversal of 102000021111001 is 100111120000201.
It can be written as a sum of positive squares in 4 ways, for example, as 6843429840025 + 95156591270976 = 2615995^2 + 9754824^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 102000021111001 - 23 = 102000021110993 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102000021111011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 269308440 + ... + 269686921.
It is an arithmetic number, because the mean of its divisors is an integer number (13731715339993).
Almost surely, 2102000021111001 is an apocalyptic number.
It is an amenable number.
102000021111001 is a deficient number, since it is larger than the sum of its proper divisors (7853701608943).
102000021111001 is a wasteful number, since it uses less digits than its factorization.
102000021111001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 539009931.
The product of its (nonzero) digits is 4, while the sum is 10.
Adding to 102000021111001 its reverse (100111120000201), we get a palindrome (202111141111202).
The spelling of 102000021111001 in words is "one hundred two trillion, twenty-one million, one hundred eleven thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •