Base | Representation |
---|---|
bin | 11111101000110000101… |
… | …00001000010100111111 |
3 | 10211220211022111001110011 |
4 | 33310120110020110333 |
5 | 120302221332443223 |
6 | 2151213221124051 |
7 | 141351506056666 |
oct | 17643024102477 |
9 | 3756738431404 |
10 | 1087034656063 |
11 | 38a0107a7214 |
12 | 156811859627 |
13 | 7b67894b925 |
14 | 3a88159dddd |
15 | 1d4225e780d |
hex | fd1850853f |
1087034656063 has 8 divisors (see below), whose sum is σ = 1091106853200. Its totient is φ = 1082964923328.
The previous prime is 1087034655961. The next prime is 1087034656129. The reversal of 1087034656063 is 3606564307801.
1087034656063 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
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 1087034656063 - 213 = 1087034647871 is a prime.
It is a Duffinian number.
It is a junction number, because it is equal to n+sod(n) for n = 1087034655998 and 1087034656016.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1087034653063) 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, 270123 + ... + 1499011.
It is an arithmetic number, because the mean of its divisors is an integer number (136388356650).
Almost surely, 21087034656063 is an apocalyptic number.
1087034656063 is a deficient number, since it is larger than the sum of its proper divisors (4072197137).
1087034656063 is a wasteful number, since it uses less digits than its factorization.
1087034656063 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 1232201.
The product of its (nonzero) digits is 2177280, while the sum is 49.
The spelling of 1087034656063 in words is "one trillion, eighty-seven billion, thirty-four million, six hundred fifty-six thousand, sixty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •