Base | Representation |
---|---|
bin | 11101010000001010100… |
… | …10001110011011101010 |
3 | 10120002100220200200120121 |
4 | 32220011102032123222 |
5 | 112431431404323200 |
6 | 2045424105113454 |
7 | 132421405425616 |
oct | 16500522163352 |
9 | 3502326620517 |
10 | 1005111011050 |
11 | 3582a0a65173 |
12 | 14296978888a |
13 | 73a21124a33 |
14 | 3690d164346 |
15 | 1b22a2e9e1a |
hex | ea0548e6ea |
1005111011050 has 12 divisors (see below), whose sum is σ = 1869506480646. Its totient is φ = 402044404400.
The previous prime is 1005111011017. The next prime is 1005111011059. The reversal of 1005111011050 is 501101115001.
It can be written as a sum of positive squares in 3 ways, for example, as 824342332489 + 180768678561 = 907933^2 + 425169^2 .
It is not an unprimeable number, because it can be changed into a prime (1005111011059) 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 5 ways as a sum of consecutive naturals, for example, 10051110061 + ... + 10051110160.
Almost surely, 21005111011050 is an apocalyptic number.
1005111011050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1005111011050 is a deficient number, since it is larger than the sum of its proper divisors (864395469596).
1005111011050 is a wasteful number, since it uses less digits than its factorization.
1005111011050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 20102220233 (or 20102220228 counting only the distinct ones).
The product of its (nonzero) digits is 25, while the sum is 16.
Adding to 1005111011050 its reverse (501101115001), we get a palindrome (1506212126051).
The spelling of 1005111011050 in words is "one trillion, five billion, one hundred eleven million, eleven thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.077 sec. • engine limits •