Base | Representation |
---|---|
bin | 11110100101000000100… |
… | …01101111100101101100 |
3 | 10201102221101002012112010 |
4 | 33102200101233211230 |
5 | 114203223210314111 |
6 | 2122400024041220 |
7 | 135623234240520 |
oct | 17224021574554 |
9 | 3642841065463 |
10 | 1050661026156 |
11 | 375645838755 |
12 | 14b760303210 |
13 | 780ccc801b1 |
14 | 38bd0887d80 |
15 | 1c4e4180aa6 |
hex | f4a046f96c |
1050661026156 has 48 divisors (see below), whose sum is σ = 2803803657984. Its totient is φ = 299970194496.
The previous prime is 1050661026139. The next prime is 1050661026157. The reversal of 1050661026156 is 6516201660501.
1050661026156 is digitally balanced in base 2 and base 4, because in such bases it contains all the possibile digits an equal number of times.
It is a super-2 number, since 2×10506610261562 (a number of 25 digits) contains 22 as substring.
It is not an unprimeable number, because it can be changed into a prime (1050661026157) by changing a digit.
It is a polite number, since it can be written in 15 ways as a sum of consecutive naturals, for example, 4439610 + ... + 4670273.
It is an arithmetic number, because the mean of its divisors is an integer number (58412576208).
Almost surely, 21050661026156 is an apocalyptic number.
It is an amenable number.
1050661026156 is an abundant number, since it is smaller than the sum of its proper divisors (1753142631828).
It is a pseudoperfect number, because it is the sum of a subset of its proper divisors.
1050661026156 is a wasteful number, since it uses less digits than its factorization.
1050661026156 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 9111270 (or 9111268 counting only the distinct ones).
The product of its (nonzero) digits is 64800, while the sum is 39.
Adding to 1050661026156 its reverse (6516201660501), we get a palindrome (7566862686657).
The spelling of 1050661026156 in words is "one trillion, fifty billion, six hundred sixty-one million, twenty-six thousand, one hundred fifty-six".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •