Base | Representation |
---|---|
bin | 100001001011000… |
… | …1011110111000001 |
3 | 2212120111221121102 |
4 | 1002112023313001 |
5 | 4234424041001 |
6 | 302241504145 |
7 | 36404203331 |
oct | 10226136701 |
9 | 2776457542 |
10 | 1113112001 |
11 | 521360581 |
12 | 270942055 |
13 | 1497c1b71 |
14 | a7b930c1 |
15 | 67ac5e6b |
hex | 4258bdc1 |
1113112001 has 2 divisors, whose sum is σ = 1113112002. Its totient is φ = 1113112000.
The previous prime is 1113111997. The next prime is 1113112003. The reversal of 1113112001 is 1002113111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 566487601 + 546624400 = 23801^2 + 23380^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113112001 - 22 = 1113111997 is a prime.
Together with 1113112003, it forms a pair of twin primes.
It is a Chen prime.
It is not a weakly prime, because it can be changed into another prime (1113112003) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556556000 + 556556001.
It is an arithmetic number, because the mean of its divisors is an integer number (556556001).
Almost surely, 21113112001 is an apocalyptic number.
It is an amenable number.
1113112001 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113112001 is an equidigital number, since it uses as much as digits as its factorization.
1113112001 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 6, while the sum is 11.
The square root of 1113112001 is about 33363.3331818030. Note that the first 3 decimals coincide. The cubic root of 1113112001 is about 1036.3655188348.
Adding to 1113112001 its reverse (1002113111), we get a palindrome (2115225112).
It can be divided in two parts, 11131 and 12001, that added together give a palindrome (23132).
The spelling of 1113112001 in words is "one billion, one hundred thirteen million, one hundred twelve thousand, one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •