Base | Representation |
---|---|
bin | 11111101001101110101… |
… | …01111101101010101101 |
3 | 10211222011121000222011110 |
4 | 33310313111331222231 |
5 | 120304303114333011 |
6 | 2151341014542233 |
7 | 141400426634244 |
oct | 17646725755255 |
9 | 3758147028143 |
10 | 1087555230381 |
11 | 38a258636424 |
12 | 156938067979 |
13 | 7b72c758679 |
14 | 3a8d078d95b |
15 | 1d453176ba6 |
hex | fd3757daad |
1087555230381 has 8 divisors (see below), whose sum is σ = 1451203866720. Its totient is φ = 724471707152.
The previous prime is 1087555230347. The next prime is 1087555230383. The reversal of 1087555230381 is 1830325557801.
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 1087555230381 - 230 = 1086481488557 is a prime.
It is a super-2 number, since 2×10875552303812 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1087555230381.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1087555230383) 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, 141273786 + ... + 141281483.
It is an arithmetic number, because the mean of its divisors is an integer number (181400483340).
Almost surely, 21087555230381 is an apocalyptic number.
It is an amenable number.
1087555230381 is a deficient number, since it is larger than the sum of its proper divisors (363648636339).
1087555230381 is a wasteful number, since it uses less digits than its factorization.
1087555230381 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 282556555.
The product of its (nonzero) digits is 1008000, while the sum is 48.
The spelling of 1087555230381 in words is "one trillion, eighty-seven billion, five hundred fifty-five million, two hundred thirty thousand, three hundred eighty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.030 sec. • engine limits •