Base | Representation |
---|---|
bin | 1001101001011010010111… |
… | …0100111011111101100101 |
3 | 1101120000122222220010100022 |
4 | 2122112211310323331211 |
5 | 2342241222412342212 |
6 | 34320451525524525 |
7 | 2143222513354202 |
oct | 232264564737545 |
9 | 41500588803308 |
10 | 10607056371557 |
11 | 341a477883a48 |
12 | 1233875873745 |
13 | 5bc3199981c9 |
14 | 289554604ca9 |
15 | 135da9512772 |
hex | 9a5a5d3bf65 |
10607056371557 has 2 divisors, whose sum is σ = 10607056371558. Its totient is φ = 10607056371556.
The previous prime is 10607056371503. The next prime is 10607056371577. The reversal of 10607056371557 is 75517365070601.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 8691376156996 + 1915680214561 = 2948114^2 + 1384081^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-10607056371557 is a prime.
It is a super-2 number, since 2×106070563715572 (a number of 27 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 10607056371499 and 10607056371508.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10607056371577) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5303528185778 + 5303528185779.
It is an arithmetic number, because the mean of its divisors is an integer number (5303528185779).
Almost surely, 210607056371557 is an apocalyptic number.
It is an amenable number.
10607056371557 is a deficient number, since it is larger than the sum of its proper divisors (1).
10607056371557 is an equidigital number, since it uses as much as digits as its factorization.
10607056371557 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 4630500, while the sum is 53.
The spelling of 10607056371557 in words is "ten trillion, six hundred seven billion, fifty-six million, three hundred seventy-one thousand, five hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.104 sec. • engine limits •