Base | Representation |
---|---|
bin | 11110100100110010110… |
… | …01000010111101100000 |
3 | 10201102122022200212102121 |
4 | 33102121121002331200 |
5 | 114203004122000000 |
6 | 2122340335554024 |
7 | 135620332261543 |
oct | 17223131027540 |
9 | 3642568625377 |
10 | 1050545500000 |
11 | 375596602197 |
12 | 14b72968b914 |
13 | 780b2061719 |
14 | 38bbd3b485a |
15 | 1c4d8e60b1a |
hex | f499642f60 |
1050545500000 has 84 divisors (see below), whose sum is σ = 2585294954676. Its totient is φ = 420218000000.
The previous prime is 1050545499973. The next prime is 1050545500049. The reversal of 1050545500000 is 55450501.
It is a super-2 number, since 2×10505455000002 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (25).
It is a congruent number.
It is an unprimeable number.
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 13 ways as a sum of consecutive naturals, for example, 550546 + ... + 1550545.
It is an arithmetic number, because the mean of its divisors is an integer number (30777320889).
Almost surely, 21050545500000 is an apocalyptic number.
1050545500000 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
It is an amenable number.
1050545500000 is an abundant number, since it is smaller than the sum of its proper divisors (1534749454676).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050545500000 is an frugal number, since it uses more digits than its factorization.
1050545500000 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 2101131 (or 2101098 counting only the distinct ones).
The product of its (nonzero) digits is 2500, while the sum is 25.
The spelling of 1050545500000 in words is "one trillion, fifty billion, five hundred forty-five million, five hundred thousand".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.029 sec. • engine limits •