Base | Representation |
---|---|
bin | 101111100011000111… |
… | …1001010100101100101 |
3 | 100202120020012010212202 |
4 | 1133012033022211211 |
5 | 3133110142041401 |
6 | 114524142024245 |
7 | 10243245426554 |
oct | 1370617124545 |
9 | 322506163782 |
10 | 102110112101 |
11 | 3a3395505a8 |
12 | 17958578085 |
13 | 9823a2b19a |
14 | 4d293bdd9b |
15 | 29c95ed06b |
hex | 17c63ca965 |
102110112101 has 4 divisors (see below), whose sum is σ = 102116956704. Its totient is φ = 102103267500.
The previous prime is 102110112089. The next prime is 102110112127. The reversal of 102110112101 is 101211011201.
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, and also an emirpimes, since its reverse is a distinct semiprime: 101211011201 = 29 ⋅3490034869.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-102110112101 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 (102110112131) 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, 3399875 + ... + 3429776.
It is an arithmetic number, because the mean of its divisors is an integer number (25529239176).
Almost surely, 2102110112101 is an apocalyptic number.
It is an amenable number.
102110112101 is a deficient number, since it is larger than the sum of its proper divisors (6844603).
102110112101 is an equidigital number, since it uses as much as digits as its factorization.
102110112101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 6844602.
The product of its (nonzero) digits is 4, while the sum is 11.
Adding to 102110112101 its reverse (101211011201), we get a palindrome (203321123302).
The spelling of 102110112101 in words is "one hundred two billion, one hundred ten million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •