Base | Representation |
---|---|
bin | 100001001000111… |
… | …1100011001100101 |
3 | 2212111102110100221 |
4 | 1002101330121211 |
5 | 4234133000401 |
6 | 302202004341 |
7 | 36361562542 |
oct | 10221743145 |
9 | 2774373327 |
10 | 1112000101 |
11 | 520771153 |
12 | 2704a66b1 |
13 | 1494c2a34 |
14 | a7983bc9 |
15 | 679567a1 |
hex | 4247c665 |
1112000101 has 4 divisors (see below), whose sum is σ = 1147871104. Its totient is φ = 1076129100.
The previous prime is 1112000069. The next prime is 1112000111. The reversal of 1112000101 is 1010002111.
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: 1010002111 = 29 ⋅34827659.
It is a cyclic number.
It is not a de Polignac number, because 1112000101 - 25 = 1112000069 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 (1112000111) 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, 17935455 + ... + 17935516.
It is an arithmetic number, because the mean of its divisors is an integer number (286967776).
Almost surely, 21112000101 is an apocalyptic number.
It is an amenable number.
1112000101 is a deficient number, since it is larger than the sum of its proper divisors (35871003).
1112000101 is an equidigital number, since it uses as much as digits as its factorization.
1112000101 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 35871002.
The product of its (nonzero) digits is 2, while the sum is 7.
The square root of 1112000101 is about 33346.6655154605. The cubic root of 1112000101 is about 1036.0203248424.
Adding to 1112000101 its reverse (1010002111), we get a palindrome (2122002212).
The spelling of 1112000101 in words is "one billion, one hundred twelve million, one hundred one", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.000 sec. • engine limits •