Base | Representation |
---|---|
bin | 11110100100110011010… |
… | …10101000100101100001 |
3 | 10201102122122101002221010 |
4 | 33102121222220211201 |
5 | 114203011312014221 |
6 | 2122341022451133 |
7 | 135620416413450 |
oct | 17223152504541 |
9 | 3642578332833 |
10 | 1050550110561 |
11 | 375599171176 |
12 | 14b72b133aa9 |
13 | 780b2cb7173 |
14 | 38bbdc54b97 |
15 | 1c4d9571c76 |
hex | f499aa8961 |
1050550110561 has 16 divisors (see below), whose sum is σ = 1602539503488. Its totient is φ = 599676384000.
The previous prime is 1050550110553. The next prime is 1050550110563. The reversal of 1050550110561 is 1650110550501.
It is not a de Polignac number, because 1050550110561 - 23 = 1050550110553 is a prime.
It is a super-2 number, since 2×10505501105612 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1050550110563) 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 in 15 ways as a sum of consecutive naturals, for example, 26561640 + ... + 26601161.
It is an arithmetic number, because the mean of its divisors is an integer number (100158718968).
Almost surely, 21050550110561 is an apocalyptic number.
It is an amenable number.
1050550110561 is a deficient number, since it is larger than the sum of its proper divisors (551989392927).
1050550110561 is an equidigital number, since it uses as much as digits as its factorization.
1050550110561 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 53163752.
The product of its (nonzero) digits is 3750, while the sum is 30.
The spelling of 1050550110561 in words is "one trillion, fifty billion, five hundred fifty million, one hundred ten thousand, five hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.066 sec. • engine limits •