Base | Representation |
---|---|
bin | 1001110001100001001111… |
… | …1010100100011000001001 |
3 | 1102001100012001221011021102 |
4 | 2130120103322210120021 |
5 | 2402032002111420144 |
6 | 34504445042351145 |
7 | 2156253244233614 |
oct | 234302372443011 |
9 | 42040161834242 |
10 | 10746342295049 |
11 | 3473553083909 |
12 | 125686835b4b5 |
13 | 5cc4b662c90a |
14 | 2921a907317b |
15 | 13980c6d0b4e |
hex | 9c613ea4609 |
10746342295049 has 2 divisors, whose sum is σ = 10746342295050. Its totient is φ = 10746342295048.
The previous prime is 10746342295033. The next prime is 10746342295057. The reversal of 10746342295049 is 94059224364701.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 7791037485049 + 2955304810000 = 2791243^2 + 1719100^2 .
It is a cyclic number.
It is not a de Polignac number, because 10746342295049 - 24 = 10746342295033 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 10746342294985 and 10746342295003.
It is not a weakly prime, because it can be changed into another prime (10746342295019) 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, 5373171147524 + 5373171147525.
It is an arithmetic number, because the mean of its divisors is an integer number (5373171147525).
Almost surely, 210746342295049 is an apocalyptic number.
It is an amenable number.
10746342295049 is a deficient number, since it is larger than the sum of its proper divisors (1).
10746342295049 is an equidigital number, since it uses as much as digits as its factorization.
10746342295049 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 13063680, while the sum is 56.
The spelling of 10746342295049 in words is "ten trillion, seven hundred forty-six billion, three hundred forty-two million, two hundred ninety-five thousand, forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •