Base | Representation |
---|---|
bin | 1001110001100001001111… |
… | …1010100100011000010010 |
3 | 1102001100012001221011021202 |
4 | 2130120103322210120102 |
5 | 2402032002111420213 |
6 | 34504445042351202 |
7 | 2156253244233626 |
oct | 234302372443022 |
9 | 42040161834252 |
10 | 10746342295058 |
11 | 3473553083917 |
12 | 125686835b502 |
13 | 5cc4b662c916 |
14 | 2921a9073186 |
15 | 13980c6d0b58 |
hex | 9c613ea4612 |
10746342295058 has 8 divisors (see below), whose sum is σ = 16129012277052. Its totient is φ = 5370004869376.
The previous prime is 10746342295057. The next prime is 10746342295103. The reversal of 10746342295058 is 85059224364701.
It can be written as a sum of positive squares in 2 ways, for example, as 7558557014089 + 3187785280969 = 2749283^2 + 1785437^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is a junction number, because it is equal to n+sod(n) for n = 10746342294994 and 10746342295012.
It is not an unprimeable number, because it can be changed into a prime (10746342295057) 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 in 3 ways as a sum of consecutive naturals, for example, 1583134835 + ... + 1583141622.
It is a 1-persistent number, because it is pandigital, but 2⋅10746342295058 = 21492684590116 is not.
Almost surely, 210746342295058 is an apocalyptic number.
10746342295058 is a deficient number, since it is larger than the sum of its proper divisors (5382669981994).
10746342295058 is a wasteful number, since it uses less digits than its factorization.
10746342295058 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 3166278156.
The product of its (nonzero) digits is 14515200, while the sum is 56.
The spelling of 10746342295058 in words is "ten trillion, seven hundred forty-six billion, three hundred forty-two million, two hundred ninety-five thousand, fifty-eight".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •