Base | Representation |
---|---|
bin | 11111101010001010011… |
… | …11110111011100100101 |
3 | 10211222202211222221211201 |
4 | 33311011033313130211 |
5 | 120310242324404221 |
6 | 2151420111002501 |
7 | 141406261541545 |
oct | 17650517673445 |
9 | 3758684887751 |
10 | 1087788513061 |
11 | 38a368291128 |
12 | 1569a2209431 |
13 | 7b768b96b63 |
14 | 3a913757325 |
15 | 1d4688a7891 |
hex | fd453f7725 |
1087788513061 has 8 divisors (see below), whose sum is σ = 1098778250240. Its totient is φ = 1076817140208.
The previous prime is 1087788513059. The next prime is 1087788513079. The reversal of 1087788513061 is 1603158877801.
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 1087788513061 - 21 = 1087788513059 is a prime.
It is a super-2 number, since 2×10877885130612 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1087788512993 and 1087788513011.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1087788513041) 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, 4472001 + ... + 4708966.
It is an arithmetic number, because the mean of its divisors is an integer number (137347281280).
Almost surely, 21087788513061 is an apocalyptic number.
It is an amenable number.
1087788513061 is a deficient number, since it is larger than the sum of its proper divisors (10989737179).
1087788513061 is a wasteful number, since it uses less digits than its factorization.
1087788513061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 9182163.
The product of its (nonzero) digits is 2257920, while the sum is 55.
The spelling of 1087788513061 in words is "one trillion, eighty-seven billion, seven hundred eighty-eight million, five hundred thirteen thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.064 sec. • engine limits •