Base | Representation |
---|---|
bin | 101111100011001011… |
… | …0110010110111100101 |
3 | 100202120100221202100211 |
4 | 1133012112302313211 |
5 | 3133111200041401 |
6 | 114524252535421 |
7 | 10243301426506 |
oct | 1370626626745 |
9 | 322510852324 |
10 | 102112112101 |
11 | 3a33a69719a |
12 | 17959181571 |
13 | 982427b60c |
14 | 4d29780bad |
15 | 29c9895951 |
hex | 17c65b2de5 |
102112112101 has 4 divisors (see below), whose sum is σ = 102444725152. Its totient is φ = 101779499052.
The previous prime is 102112112033. The next prime is 102112112153. The reversal of 102112112101 is 101211211201.
It is a happy number.
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: 101211211201 = 4139 ⋅24453059.
It is a cyclic number.
It is not a de Polignac number, because 102112112101 - 229 = 101575241189 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 (102112112191) 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, 166306065 + ... + 166306678.
It is an arithmetic number, because the mean of its divisors is an integer number (25611181288).
Almost surely, 2102112112101 is an apocalyptic number.
It is an amenable number.
102112112101 is a deficient number, since it is larger than the sum of its proper divisors (332613051).
102112112101 is an equidigital number, since it uses as much as digits as its factorization.
102112112101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 332613050.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 102112112101 its reverse (101211211201), we get a palindrome (203323323302).
The spelling of 102112112101 in words is "one hundred two billion, one hundred twelve million, one hundred twelve thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.087 sec. • engine limits •