Base | Representation |
---|---|
bin | 10111001101111010010011… |
… | …001000111110111111011101 |
3 | 111101112201101121221122220012 |
4 | 113031322103020332333131 |
5 | 101340441332400213041 |
6 | 1001101053331133005 |
7 | 30336164202344552 |
oct | 2715722310767735 |
9 | 441481347848805 |
10 | 102111021101021 |
11 | 2a59904a423409 |
12 | b551972444165 |
13 | 44c90495c19aa |
14 | 1b302b2326a29 |
15 | bc121e3433eb |
hex | 5cde9323efdd |
102111021101021 has 64 divisors (see below), whose sum is σ = 109679765852160. Its totient is φ = 94939054080000.
The previous prime is 102111021100951. The next prime is 102111021101039. The reversal of 102111021101021 is 120101120111201.
It is a cyclic number.
It is not a de Polignac number, because 102111021101021 - 214 = 102111021084637 is a prime.
It is a Duffinian number.
It is a Curzon number.
It is a junction number, because it is equal to n+sod(n) for n = 102111021100987 and 102111021101005.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (102111021101081) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 3951499061 + ... + 3951524901.
It is an arithmetic number, because the mean of its divisors is an integer number (1713746341440).
Almost surely, 2102111021101021 is an apocalyptic number.
It is an amenable number.
102111021101021 is a deficient number, since it is larger than the sum of its proper divisors (7568744751139).
102111021101021 is a wasteful number, since it uses less digits than its factorization.
102111021101021 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 26366.
The product of its (nonzero) digits is 8, while the sum is 14.
Adding to 102111021101021 its reverse (120101120111201), we get a palindrome (222212141212222).
The spelling of 102111021101021 in words is "one hundred two trillion, one hundred eleven billion, twenty-one million, one hundred one thousand, twenty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.089 sec. • engine limits •