Base | Representation |
---|---|
bin | 11101001000100111001… |
… | …10000000010111100010 |
3 | 10112200220022200101010002 |
4 | 32210103212000113202 |
5 | 112400130331010200 |
6 | 2043513454340002 |
7 | 132216050353043 |
oct | 16442346002742 |
9 | 3480808611102 |
10 | 1001056110050 |
11 | 356600093017 |
12 | 1420177ba602 |
13 | 73526020229 |
14 | 366467dc8ca |
15 | 1b08e32cbd5 |
hex | e9139805e2 |
1001056110050 has 24 divisors (see below), whose sum is σ = 1864781316372. Its totient is φ = 399816648000.
The previous prime is 1001056110007. The next prime is 1001056110101. The reversal of 1001056110050 is 500116501001.
It can be written as a sum of positive squares in 6 ways, for example, as 545510756569 + 455545353481 = 738587^2 + 674941^2 .
It is a super-2 number, since 2×10010561100502 (a number of 25 digits) contains 22 as substring.
It is an unprimeable number.
It is a pernicious number, because its binary representation contains a prime number (17) of ones.
It is a polite number, since it can be written in 11 ways as a sum of consecutive naturals, for example, 15111521 + ... + 15177620.
Almost surely, 21001056110050 is an apocalyptic number.
1001056110050 is a gapful number since it is divisible by the number (10) formed by its first and last digit.
1001056110050 is a deficient number, since it is larger than the sum of its proper divisors (863725206322).
1001056110050 is a wasteful number, since it uses less digits than its factorization.
1001056110050 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 30289814 (or 30289809 counting only the distinct ones).
The product of its (nonzero) digits is 150, while the sum is 20.
The spelling of 1001056110050 in words is "one trillion, one billion, fifty-six million, one hundred ten thousand, fifty".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •