Base | Representation |
---|---|
bin | 1010000011001110101100… |
… | …1001011011000001011010 |
3 | 1110010102112101100212101102 |
4 | 2200303223021123001122 |
5 | 2422023112324013200 |
6 | 35300324230351402 |
7 | 2220244123454612 |
oct | 240635311330132 |
9 | 43112471325342 |
10 | 11050601001050 |
11 | 35805961a3a46 |
12 | 12a581babb562 |
13 | 6220b48501b0 |
14 | 2a2bcda2da42 |
15 | 1426b8bb86d5 |
hex | a0ceb25b05a |
11050601001050 has 48 divisors (see below), whose sum is σ = 22141626204600. Its totient is φ = 4079038064640.
The previous prime is 11050601001031. The next prime is 11050601001053. The reversal of 11050601001050 is 5010010605011.
It can be written as a sum of positive squares in 12 ways, for example, as 2508653680129 + 8541947320921 = 1583873^2 + 2922661^2 .
It is a super-2 number, since 2×110506010010502 (a number of 27 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (11050601001053) by changing a digit.
It is a polite number, since it can be written in 23 ways as a sum of consecutive naturals, for example, 222767 + ... + 4706466.
Almost surely, 211050601001050 is an apocalyptic number.
11050601001050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
11050601001050 is an abundant number, since it is smaller than the sum of its proper divisors (11091025203550).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
11050601001050 is a wasteful number, since it uses less digits than its factorization.
11050601001050 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 4932707 (or 4932702 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
Adding to 11050601001050 its reverse (5010010605011), we get a palindrome (16060611606061).
The spelling of 11050601001050 in words is "eleven trillion, fifty billion, six hundred one million, one thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •