Base | Representation |
---|---|
bin | 11111101001010111110… |
… | …10100110101110100101 |
3 | 10211221200020021112002101 |
4 | 33310223322212232211 |
5 | 120303410024243112 |
6 | 2151310005412101 |
7 | 141362611220242 |
oct | 17645372465645 |
9 | 3757606245071 |
10 | 1087363509157 |
11 | 38a16a398432 |
12 | 1568a3a0a031 |
13 | 7b6cbb0c663 |
14 | 3a8b31245c9 |
15 | 1d441405757 |
hex | fd2bea6ba5 |
1087363509157 has 4 divisors (see below), whose sum is σ = 1088215008876. Its totient is φ = 1086512009440.
The previous prime is 1087363509139. The next prime is 1087363509179. The reversal of 1087363509157 is 7519053637801.
It is a semiprime because it is the product of two primes.
It can be written as a sum of positive squares in 2 ways, for example, as 399391136676 + 687972372481 = 631974^2 + 829441^2 .
It is a cyclic number.
It is not a de Polignac number, because 1087363509157 - 215 = 1087363476389 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1087363509098 and 1087363509107.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1087363509257) by changing a digit.
It is a polite number, since it can be written in 3 ways as a sum of consecutive naturals, for example, 425747944 + ... + 425750497.
It is an arithmetic number, because the mean of its divisors is an integer number (272053752219).
Almost surely, 21087363509157 is an apocalyptic number.
It is an amenable number.
1087363509157 is a deficient number, since it is larger than the sum of its proper divisors (851499719).
1087363509157 is an equidigital number, since it uses as much as digits as its factorization.
1087363509157 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 851499718.
The product of its (nonzero) digits is 4762800, while the sum is 55.
The spelling of 1087363509157 in words is "one trillion, eighty-seven billion, three hundred sixty-three million, five hundred nine thousand, one hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •