Base | Representation |
---|---|
bin | 10000011011011100110… |
… | …010001100100011010001 |
3 | 10222221002221112200021212 |
4 | 100123130302030203101 |
5 | 121444130301441211 |
6 | 2222352051025505 |
7 | 144365213033633 |
oct | 20333462144321 |
9 | 3887087480255 |
10 | 1128985577681 |
11 | 3a5888a20575 |
12 | 16297ab9b295 |
13 | 82602c53780 |
14 | 3c900ccca53 |
15 | 1e57a4ea38b |
hex | 106dcc8c8d1 |
1128985577681 has 8 divisors (see below), whose sum is σ = 1215841232424. Its totient is φ = 1042131438720.
The previous prime is 1128985577663. The next prime is 1128985577743. The reversal of 1128985577681 is 1867755898211.
It is a happy number.
It can be written as a sum of positive squares in 4 ways, for example, as 16424729281 + 1112560848400 = 128159^2 + 1054780^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a cyclic number.
It is not a de Polignac number, because 1128985577681 - 26 = 1128985577617 is a prime.
It is a super-2 number, since 2×11289855776812 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1128985577651) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 1520741 + ... + 2137901.
It is an arithmetic number, because the mean of its divisors is an integer number (151980154053).
Almost surely, 21128985577681 is an apocalyptic number.
It is an amenable number.
1128985577681 is a deficient number, since it is larger than the sum of its proper divisors (86855654743).
1128985577681 is a wasteful number, since it uses less digits than its factorization.
1128985577681 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 757891.
The product of its digits is 67737600, while the sum is 68.
The spelling of 1128985577681 in words is "one trillion, one hundred twenty-eight billion, nine hundred eighty-five million, five hundred seventy-seven thousand, six hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •