Base | Representation |
---|---|
bin | 1001001001010010001011… |
… | …1101101111011111000001 |
3 | 1022121020222120002212021221 |
4 | 2102110202331233133001 |
5 | 2304220323343104221 |
6 | 33215130153315041 |
7 | 2055312606503344 |
oct | 222244275573701 |
9 | 38536876085257 |
10 | 10055105050561 |
11 | 322738973511a |
12 | 11648b6405a81 |
13 | 57c26674840c |
14 | 26a95386845b |
15 | 126852a90541 |
hex | 92522f6f7c1 |
10055105050561 has 2 divisors, whose sum is σ = 10055105050562. Its totient is φ = 10055105050560.
The previous prime is 10055105050559. The next prime is 10055105050591. The reversal of 10055105050561 is 16505050155001.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 7809962426161 + 2245142624400 = 2794631^2 + 1498380^2 .
It is a cyclic number.
It is not a de Polignac number, because 10055105050561 - 21 = 10055105050559 is a prime.
It is a super-2 number, since 2×100551050505612 (a number of 27 digits) contains 22 as substring.
Together with 10055105050559, it forms a pair of twin primes.
It is not a weakly prime, because it can be changed into another prime (10055105050591) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 5027552525280 + 5027552525281.
It is an arithmetic number, because the mean of its divisors is an integer number (5027552525281).
Almost surely, 210055105050561 is an apocalyptic number.
It is an amenable number.
10055105050561 is a deficient number, since it is larger than the sum of its proper divisors (1).
10055105050561 is an equidigital number, since it uses as much as digits as its factorization.
10055105050561 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 18750, while the sum is 34.
The spelling of 10055105050561 in words is "ten trillion, fifty-five billion, one hundred five million, fifty thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •