Base | Representation |
---|---|
bin | 1001110001100001001111… |
… | …1010100100011000010001 |
3 | 1102001100012001221011021201 |
4 | 2130120103322210120101 |
5 | 2402032002111420212 |
6 | 34504445042351201 |
7 | 2156253244233625 |
oct | 234302372443021 |
9 | 42040161834251 |
10 | 10746342295057 |
11 | 3473553083916 |
12 | 125686835b501 |
13 | 5cc4b662c915 |
14 | 2921a9073185 |
15 | 13980c6d0b57 |
hex | 9c613ea4611 |
10746342295057 has 2 divisors, whose sum is σ = 10746342295058. Its totient is φ = 10746342295056.
The previous prime is 10746342295049. The next prime is 10746342295103. The reversal of 10746342295057 is 75059224364701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10740197146176 + 6145148881 = 3277224^2 + 78391^2 .
It is a cyclic number.
It is not a de Polignac number, because 10746342295057 - 23 = 10746342295049 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10746342294989 and 10746342295007.
It is not a weakly prime, because it can be changed into another prime (10746342295957) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5373171147528 + 5373171147529.
It is an arithmetic number, because the mean of its divisors is an integer number (5373171147529).
Almost surely, 210746342295057 is an apocalyptic number.
It is an amenable number.
10746342295057 is a deficient number, since it is larger than the sum of its proper divisors (1).
10746342295057 is an equidigital number, since it uses as much as digits as its factorization.
10746342295057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 12700800, while the sum is 55.
The spelling of 10746342295057 in words is "ten trillion, seven hundred forty-six billion, three hundred forty-two million, two hundred ninety-five thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •