Base | Representation |
---|---|
bin | 1001101011101011111100… |
… | …0100110101111001000101 |
3 | 1101200202112102121201200121 |
4 | 2122322333010311321011 |
5 | 2343411240434131221 |
6 | 34350433341341541 |
7 | 2146105066442062 |
oct | 232727704657105 |
9 | 41622472551617 |
10 | 10646134677061 |
11 | 34350005322a4 |
12 | 123b360b678b1 |
13 | 5c2c06ac95c0 |
14 | 28b3c0609c69 |
15 | 136de5134a41 |
hex | 9aebf135e45 |
10646134677061 has 8 divisors (see below), whose sum is σ = 11466193054680. Its totient is φ = 9826237005312.
The previous prime is 10646134677047. The next prime is 10646134677107. The reversal of 10646134677061 is 16077643164601.
It can be written as a sum of positive squares in 4 ways, for example, as 8713289025 + 10637421388036 = 93345^2 + 3261506^2 .
It is a sphenic number, since it is the product of 3 distinct primes.
It is not a de Polignac number, because 10646134677061 - 29 = 10646134676549 is a prime.
It is a super-2 number, since 2×106461346770612 (a number of 27 digits) contains 22 as substring.
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (10646134677011) by changing a digit.
It is a polite number, since it can be written in 7 ways as a sum of consecutive naturals, for example, 40038856 + ... + 40303873.
It is an arithmetic number, because the mean of its divisors is an integer number (1433274131835).
Almost surely, 210646134677061 is an apocalyptic number.
It is an amenable number.
10646134677061 is a deficient number, since it is larger than the sum of its proper divisors (820058377619).
10646134677061 is a wasteful number, since it uses less digits than its factorization.
10646134677061 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 80352935.
The product of its (nonzero) digits is 3048192, while the sum is 52.
The spelling of 10646134677061 in words is "ten trillion, six hundred forty-six billion, one hundred thirty-four million, six hundred seventy-seven thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •