Base | Representation |
---|---|
bin | 11110100100101110101… |
… | …01011110110011110000 |
3 | 10201102112220210122111022 |
4 | 33102113111132303300 |
5 | 114202421304323211 |
6 | 2122333104435012 |
7 | 135616433155643 |
oct | 17222725366360 |
9 | 3642486718438 |
10 | 1050511011056 |
11 | 375579096131 |
12 | 14b71a018a68 |
13 | 780a7b77470 |
14 | 38bb8997a5a |
15 | 1c4d5debbdb |
hex | f49755ecf0 |
1050511011056 has 40 divisors (see below), whose sum is σ = 2251173040704. Its totient is φ = 471747144960.
The previous prime is 1050511011049. The next prime is 1050511011071. The reversal of 1050511011056 is 6501101150501.
It is a super-2 number, since 2×10505110110562 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (26).
It is a congruent number.
It is an unprimeable number.
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 in 7 ways as a sum of consecutive naturals, for example, 68242760 + ... + 68258151.
Almost surely, 21050511011056 is an apocalyptic number.
1050511011056 is a gapful number since it is divisible by the number (16) formed by its first and last digit.
It is an amenable number.
1050511011056 is an abundant number, since it is smaller than the sum of its proper divisors (1200662029648).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050511011056 is a wasteful number, since it uses less digits than its factorization.
1050511011056 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 136500969 (or 136500963 counting only the distinct ones).
The product of its (nonzero) digits is 750, while the sum is 26.
Adding to 1050511011056 its reverse (6501101150501), we get a palindrome (7551612161557).
The spelling of 1050511011056 in words is "one trillion, fifty billion, five hundred eleven million, eleven thousand, fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •