Base | Representation |
---|---|
bin | 11110101111001001010… |
… | …11101101011000111101 |
3 | 10201221222200100012001111 |
4 | 33113210223231120331 |
5 | 114300400013312002 |
6 | 2125100050242021 |
7 | 136205142626212 |
oct | 17274453553075 |
9 | 3657880305044 |
10 | 1056103650877 |
11 | 377988a84210 |
12 | 15081ab86311 |
13 | 787897257b2 |
14 | 39189647b09 |
15 | 1c711dba3d7 |
hex | f5e4aed63d |
1056103650877 has 8 divisors (see below), whose sum is σ = 1152261768960. Its totient is φ = 959970315360.
The previous prime is 1056103650799. The next prime is 1056103650881. The reversal of 1056103650877 is 7780563016501.
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 1056103650877 - 223 = 1056095262269 is a prime.
It is a super-2 number, since 2×10561036508772 (a number of 25 digits) contains 22 as substring.
It is a Duffinian number.
It is a self number, because there is not a number n which added to its sum of digits gives 1056103650877.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1056103650577) 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, 6106477 + ... + 6277042.
It is an arithmetic number, because the mean of its divisors is an integer number (144032721120).
Almost surely, 21056103650877 is an apocalyptic number.
It is an amenable number.
1056103650877 is a deficient number, since it is larger than the sum of its proper divisors (96158118083).
1056103650877 is a wasteful number, since it uses less digits than its factorization.
1056103650877 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 12391283.
The product of its (nonzero) digits is 1058400, while the sum is 49.
The spelling of 1056103650877 in words is "one trillion, fifty-six billion, one hundred three million, six hundred fifty thousand, eight hundred seventy-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •