Base | Representation |
---|---|
bin | 100001000111001… |
… | …0100111101000101 |
3 | 2212102122021221211 |
4 | 1002032110331011 |
5 | 4233412131401 |
6 | 302125411421 |
7 | 36350533645 |
oct | 10216247505 |
9 | 2772567854 |
10 | 1111052101 |
11 | 520183985 |
12 | 270109b71 |
13 | 1492503a3 |
14 | a77b8525 |
15 | 6781a951 |
hex | 42394f45 |
1111052101 has 2 divisors, whose sum is σ = 1111052102. Its totient is φ = 1111052100.
The previous prime is 1111052087. The next prime is 1111052123. The reversal of 1111052101 is 1012501111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 892455876 + 218596225 = 29874^2 + 14785^2 .
It is an emirp because it is prime and its reverse (1012501111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1111052101 - 211 = 1111050053 is a prime.
It is a super-2 number, since 2×11110521012 = 2468873542273028402, which contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1111052401) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 555526050 + 555526051.
It is an arithmetic number, because the mean of its divisors is an integer number (555526051).
Almost surely, 21111052101 is an apocalyptic number.
It is an amenable number.
1111052101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1111052101 is an equidigital number, since it uses as much as digits as its factorization.
1111052101 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 10, while the sum is 13.
The square root of 1111052101 is about 33332.4481699140. The cubic root of 1111052101 is about 1035.7258325131.
Adding to 1111052101 its reverse (1012501111), we get a palindrome (2123553212).
The spelling of 1111052101 in words is "one billion, one hundred eleven million, fifty-two thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •