Base | Representation |
---|---|
bin | 1001110001100001001111… |
… | …1010100100010110111101 |
3 | 1102001100012001221011011121 |
4 | 2130120103322210112331 |
5 | 2402032002111414343 |
6 | 34504445042350541 |
7 | 2156253244233445 |
oct | 234302372442675 |
9 | 42040161834147 |
10 | 10746342294973 |
11 | 347355308384a |
12 | 125686835b451 |
13 | 5cc4b662c87c |
14 | 2921a9073125 |
15 | 13980c6d0aed |
hex | 9c613ea45bd |
10746342294973 has 2 divisors, whose sum is σ = 10746342294974. Its totient is φ = 10746342294972.
The previous prime is 10746342294971. The next prime is 10746342295019. The reversal of 10746342294973 is 37949224364701.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 6047969584644 + 4698372710329 = 2459262^2 + 2167573^2 .
It is a cyclic number.
It is not a de Polignac number, because 10746342294973 - 21 = 10746342294971 is a prime.
Together with 10746342294971, it forms a pair of twin primes.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (10746342294971) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5373171147486 + 5373171147487.
It is an arithmetic number, because the mean of its divisors is an integer number (5373171147487).
Almost surely, 210746342294973 is an apocalyptic number.
It is an amenable number.
10746342294973 is a deficient number, since it is larger than the sum of its proper divisors (1).
10746342294973 is an equidigital number, since it uses as much as digits as its factorization.
10746342294973 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 54867456, while the sum is 61.
The spelling of 10746342294973 in words is "ten trillion, seven hundred forty-six billion, three hundred forty-two million, two hundred ninety-four thousand, nine hundred seventy-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.076 sec. • engine limits •