Base | Representation |
---|---|
bin | 11110101111001010001… |
… | …11111011110101110101 |
3 | 10201222000012021002212211 |
4 | 33113211013323311311 |
5 | 114300403412100401 |
6 | 2125100513013421 |
7 | 136205262544252 |
oct | 17274507736565 |
9 | 3658005232784 |
10 | 1056111050101 |
11 | 377992178378 |
12 | 150821554271 |
13 | 7878b116633 |
14 | 3918a612429 |
15 | 1c71287c951 |
hex | f5e51fbd75 |
1056111050101 has 2 divisors, whose sum is σ = 1056111050102. Its totient is φ = 1056111050100.
The previous prime is 1056111050087. The next prime is 1056111050117. The reversal of 1056111050101 is 1010501116501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 848563380625 + 207547669476 = 921175^2 + 455574^2 .
It is a cyclic number.
It is not a de Polignac number, because 1056111050101 - 25 = 1056111050069 is a prime.
It is a super-2 number, since 2×10561110501012 (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 (1056111056101) by changing a digit.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 528055525050 + 528055525051.
It is an arithmetic number, because the mean of its divisors is an integer number (528055525051).
Almost surely, 21056111050101 is an apocalyptic number.
It is an amenable number.
1056111050101 is a deficient number, since it is larger than the sum of its proper divisors (1).
1056111050101 is an equidigital number, since it uses as much as digits as its factorization.
1056111050101 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 150, while the sum is 22.
Adding to 1056111050101 its reverse (1010501116501), we get a palindrome (2066612166602).
The spelling of 1056111050101 in words is "one trillion, fifty-six billion, one hundred eleven million, fifty thousand, one hundred one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.085 sec. • engine limits •