Base | Representation |
---|---|
bin | 11101011001011000101… |
… | …01001001010001010101 |
3 | 10120120010220001222101222 |
4 | 32230230111021101111 |
5 | 113022101112230221 |
6 | 2052003213500125 |
7 | 132655153211042 |
oct | 16545425112125 |
9 | 3516126058358 |
10 | 1010061055061 |
11 | 35a401151533 |
12 | 14390b4a1645 |
13 | 7432c812266 |
14 | 36c5c7401c9 |
15 | 1b419b849ab |
hex | eb2c549455 |
1010061055061 has 2 divisors, whose sum is σ = 1010061055062. Its totient is φ = 1010061055060.
The previous prime is 1010061055033. The next prime is 1010061055093. The reversal of 1010061055061 is 1605501600101.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 835224176836 + 174836878225 = 913906^2 + 418135^2 .
It is a cyclic number.
It is not a de Polignac number, because 1010061055061 - 26 = 1010061054997 is a prime.
It is a self number, because there is not a number n which added to its sum of digits gives 1010061055061.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1010061055261) 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, 505030527530 + 505030527531.
It is an arithmetic number, because the mean of its divisors is an integer number (505030527531).
Almost surely, 21010061055061 is an apocalyptic number.
It is an amenable number.
1010061055061 is a deficient number, since it is larger than the sum of its proper divisors (1).
1010061055061 is an equidigital number, since it uses as much as digits as its factorization.
1010061055061 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 900, while the sum is 26.
Adding to 1010061055061 its reverse (1605501600101), we get a palindrome (2615562655162).
The spelling of 1010061055061 in words is "one trillion, ten billion, sixty-one million, fifty-five thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.082 sec. • engine limits •