Base | Representation |
---|---|
bin | 10111001101110001001010… |
… | …011111000100101011011001 |
3 | 111101111210002000210212220000 |
4 | 113031301022133010223121 |
5 | 101340311240312020441 |
6 | 1001052352132523213 |
7 | 30335366135261262 |
oct | 2715611237045331 |
9 | 441453060725800 |
10 | 102101212220121 |
11 | 2a594976585a74 |
12 | b54ba95480509 |
13 | 44c814539c45a |
14 | 1b2da21713969 |
15 | bc0d481382b6 |
hex | 5cdc4a7c4ad9 |
102101212220121 has 40 divisors (see below), whose sum is σ = 152874849688704. Its totient is φ = 67909883492160.
The previous prime is 102101212220113. The next prime is 102101212220123. The reversal of 102101212220121 is 121022212101201.
102101212220121 is a `hidden beast` number, since 1 + 0 + 210 + 1 + 212 + 220 + 1 + 21 = 666.
It is not a de Polignac number, because 102101212220121 - 23 = 102101212220113 is a prime.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102101212220094 and 102101212220103.
It is not an unprimeable number, because it can be changed into a prime (102101212220123) by changing a digit.
It is a polite number, since it can be written in 39 ways as a sum of consecutive naturals, for example, 150862716 + ... + 151537986.
Almost surely, 2102101212220121 is an apocalyptic number.
It is an amenable number.
102101212220121 is a deficient number, since it is larger than the sum of its proper divisors (50773637468583).
102101212220121 is an equidigital number, since it uses as much as digits as its factorization.
102101212220121 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 679603 (or 679594 counting only the distinct ones).
The product of its (nonzero) digits is 64, while the sum is 18.
Adding to 102101212220121 its reverse (121022212101201), we get a palindrome (223123424321322).
The spelling of 102101212220121 in words is "one hundred two trillion, one hundred one billion, two hundred twelve million, two hundred twenty thousand, one hundred twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •