Base | Representation |
---|---|
bin | 11101100101100100111… |
… | …01011100010001000101 |
3 | 10121012001001012010020111 |
4 | 32302302131130101011 |
5 | 113124002211004021 |
6 | 2055004510033021 |
7 | 133306311230614 |
oct | 16626235342105 |
9 | 3535031163214 |
10 | 1016606344261 |
11 | 36215a862152 |
12 | 1450374a8771 |
13 | 74b3385c251 |
14 | 372bdb3387b |
15 | 1b69e5ce8e1 |
hex | ecb275c445 |
1016606344261 has 2 divisors, whose sum is σ = 1016606344262. Its totient is φ = 1016606344260.
The previous prime is 1016606344241. The next prime is 1016606344283. The reversal of 1016606344261 is 1624436066101.
It is a happy number.
1016606344261 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 821678796225 + 194927548036 = 906465^2 + 441506^2 .
It is a cyclic number.
It is not a de Polignac number, because 1016606344261 - 213 = 1016606336069 is a prime.
It is a super-2 number, since 2×10166063442612 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1016606344211) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 508303172130 + 508303172131.
It is an arithmetic number, because the mean of its divisors is an integer number (508303172131).
Almost surely, 21016606344261 is an apocalyptic number.
It is an amenable number.
1016606344261 is a deficient number, since it is larger than the sum of its proper divisors (1).
1016606344261 is an equidigital number, since it uses as much as digits as its factorization.
1016606344261 is an evil number, because the sum of its binary digits is even.
The product of its (nonzero) digits is 124416, while the sum is 40.
The spelling of 1016606344261 in words is "one trillion, sixteen billion, six hundred six million, three hundred forty-four thousand, two hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •