Base | Representation |
---|---|
bin | 10111001100100110100011… |
… | …100011001110001000001001 |
3 | 111101020010022000111011212010 |
4 | 113030212203203032020021 |
5 | 101333003204114213001 |
6 | 1000551503003010133 |
7 | 30326532005430546 |
oct | 2714464343161011 |
9 | 441203260434763 |
10 | 102021102101001 |
11 | 2a5639a74a6856 |
12 | b538458809949 |
13 | 44c07194bccc5 |
14 | 1b29bc20b1bcd |
15 | bbdc0a1668d6 |
hex | 5cc9a38ce209 |
102021102101001 has 4 divisors (see below), whose sum is σ = 136028136134672. Its totient is φ = 68014068067332.
The previous prime is 102021102100997. The next prime is 102021102101029. The reversal of 102021102101001 is 100101201120201.
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 not a de Polignac number, because 102021102101001 - 22 = 102021102100997 is a prime.
It is a Duffinian number.
It is not an unprimeable number, because it can be changed into a prime (102021102101041) 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, 17003517016831 + ... + 17003517016836.
It is an arithmetic number, because the mean of its divisors is an integer number (34007034033668).
Almost surely, 2102021102101001 is an apocalyptic number.
It is an amenable number.
102021102101001 is a deficient number, since it is larger than the sum of its proper divisors (34007034033671).
102021102101001 is an equidigital number, since it uses as much as digits as its factorization.
102021102101001 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 34007034033670.
The product of its (nonzero) digits is 8, while the sum is 12.
Adding to 102021102101001 its reverse (100101201120201), we get a palindrome (202122303221202).
The spelling of 102021102101001 in words is "one hundred two trillion, twenty-one billion, one hundred two million, one hundred one thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •