Base | Representation |
---|---|
bin | 101111000101011000… |
… | …0001000101011110101 |
3 | 100122222200021222222011 |
4 | 1132022300020223311 |
5 | 3124034200401401 |
6 | 114241131404221 |
7 | 10206436566664 |
oct | 1361260105365 |
9 | 318880258864 |
10 | 101112122101 |
11 | 3997717a981 |
12 | 1771a2b3671 |
13 | 96c5045b63 |
14 | 4c72a36ddb |
15 | 296bbb7451 |
hex | 178ac08af5 |
101112122101 has 2 divisors, whose sum is σ = 101112122102. Its totient is φ = 101112122100.
The previous prime is 101112122093. The next prime is 101112122123. The reversal of 101112122101 is 101221211101.
It is a happy number.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 98279115025 + 2833007076 = 313495^2 + 53226^2 .
It is an emirp because it is prime and its reverse (101221211101) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 101112122101 - 23 = 101112122093 is a prime.
It is a super-2 number, since 2×1011121221012 (a number of 23 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (101112122171) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 50556061050 + 50556061051.
It is an arithmetic number, because the mean of its divisors is an integer number (50556061051).
Almost surely, 2101112122101 is an apocalyptic number.
It is an amenable number.
101112122101 is a deficient number, since it is larger than the sum of its proper divisors (1).
101112122101 is an equidigital number, since it uses as much as digits as its factorization.
101112122101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 8, while the sum is 13.
Adding to 101112122101 its reverse (101221211101), we get a palindrome (202333333202).
The spelling of 101112122101 in words is "one hundred one billion, one hundred twelve million, one hundred twenty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •