Base | Representation |
---|---|
bin | 10111110111111101011000… |
… | …100010110010011111110010 |
3 | 111202202221202221020100200011 |
4 | 113313331120202302133302 |
5 | 102230312112024000200 |
6 | 1011152330501045134 |
7 | 31055016352262506 |
oct | 2767753042623762 |
9 | 452687687210604 |
10 | 105000551000050 |
11 | 30502535754182 |
12 | b9399880b67aa |
13 | 467868140a934 |
14 | 1bd00a7828306 |
15 | c2148a5805ba |
hex | 5f7f588b27f2 |
105000551000050 has 24 divisors (see below), whose sum is σ = 195684720437700. Its totient is φ = 41917705222080.
The previous prime is 105000551000011. The next prime is 105000551000083. The reversal of 105000551000050 is 50000155000501.
It can be written as a sum of positive squares in 6 ways, for example, as 18897165385569 + 86103385614481 = 4347087^2 + 9279191^2 .
It is a super-2 number, since 2×1050005510000502 (a number of 29 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 105000550999985 and 105000551000030.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (29) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 2062853745 + ... + 2062904644.
Almost surely, 2105000551000050 is an apocalyptic number.
105000551000050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
105000551000050 is a deficient number, since it is larger than the sum of its proper divisors (90684169437650).
105000551000050 is a wasteful number, since it uses less digits than its factorization.
105000551000050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 4125758910 (or 4125758905 counting only the distinct ones).
The product of its (nonzero) digits is 625, while the sum is 22.
The spelling of 105000551000050 in words is "one hundred five trillion, five hundred fifty-one million, fifty", and thus it is an aban number.
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •