Base | Representation |
---|---|
bin | 100001001011001… |
… | …0101100010101101 |
3 | 2212120120222000022 |
4 | 1002112111202231 |
5 | 4234431323121 |
6 | 302242411525 |
7 | 36404430056 |
oct | 10226254255 |
9 | 2776528008 |
10 | 1113151661 |
11 | 521388356 |
12 | 270960ba5 |
13 | 149806c2b |
14 | a7ba372d |
15 | 67ad2aab |
hex | 425958ad |
1113151661 has 2 divisors, whose sum is σ = 1113151662. Its totient is φ = 1113151660.
The previous prime is 1113151649. The next prime is 1113151691. The reversal of 1113151661 is 1661513111.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 972254761 + 140896900 = 31181^2 + 11870^2 .
It is an emirp because it is prime and its reverse (1661513111) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1113151661 - 218 = 1112889517 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1113151661.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113151691) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 556575830 + 556575831.
It is an arithmetic number, because the mean of its divisors is an integer number (556575831).
Almost surely, 21113151661 is an apocalyptic number.
It is an amenable number.
1113151661 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113151661 is an equidigital number, since it uses as much as digits as its factorization.
1113151661 is an evil number, because the sum of its binary digits is even.
The product of its digits is 540, while the sum is 26.
The square root of 1113151661 is about 33363.9275415830. The cubic root of 1113151661 is about 1036.3778272004.
Adding to 1113151661 its reverse (1661513111), we get a palindrome (2774664772).
The spelling of 1113151661 in words is "one billion, one hundred thirteen million, one hundred fifty-one thousand, six hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •