Base | Representation |
---|---|
bin | 10111001101110001001010… |
… | …011111000100101011000101 |
3 | 111101111210002000210212212021 |
4 | 113031301022133010223011 |
5 | 101340311240312020401 |
6 | 1001052352132523141 |
7 | 30335366135261233 |
oct | 2715611237045305 |
9 | 441453060725767 |
10 | 102101212220101 |
11 | 2a594976585a56 |
12 | b54ba954804b1 |
13 | 44c814539c443 |
14 | 1b2da21713953 |
15 | bc0d481382a1 |
hex | 5cdc4a7c4ac5 |
102101212220101 has 8 divisors (see below), whose sum is σ = 107383380839424. Its totient is φ = 96943329921360.
The previous prime is 102101212220003. The next prime is 102101212220113. The reversal of 102101212220101 is 101022212101201.
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 102101212220101 - 215 = 102101212187333 is a prime.
It is a Duffinian number.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102101212290101) 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, 31071578461 + ... + 31071581746.
It is an arithmetic number, because the mean of its divisors is an integer number (13422922604928).
Almost surely, 2102101212220101 is an apocalyptic number.
It is an amenable number.
102101212220101 is a deficient number, since it is larger than the sum of its proper divisors (5282168619323).
102101212220101 is an equidigital number, since it uses as much as digits as its factorization.
102101212220101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 62143160291.
The product of its (nonzero) digits is 32, while the sum is 16.
Adding to 102101212220101 its reverse (101022212101201), we get a palindrome (203123424321302).
The spelling of 102101212220101 in words is "one hundred two trillion, one hundred one billion, two hundred twelve million, two hundred twenty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •