Base | Representation |
---|---|
bin | 11110100011110011000… |
… | …00100110100110001101 |
3 | 10201101021001012122101010 |
4 | 33101321200212212031 |
5 | 114200410204010221 |
6 | 2122211311235433 |
7 | 135601145631630 |
oct | 17217140464615 |
9 | 3641231178333 |
10 | 1050010610061 |
11 | 375341685496 |
12 | 14b5ba518b79 |
13 | 780282b19ba |
14 | 38b6c339c17 |
15 | 1c4a7004c76 |
hex | f47982698d |
1050010610061 has 64 divisors (see below), whose sum is σ = 1695375360000. Its totient is φ = 564668750016.
The previous prime is 1050010610053. The next prime is 1050010610123. The reversal of 1050010610061 is 1600160100501.
1050010610061 is digitally balanced in base 2, because in such base it contains all the possibile digits an equal number of times.
It is not a de Polignac number, because 1050010610061 - 23 = 1050010610053 is a prime.
It is a super-2 number, since 2×10500106100612 (a number of 25 digits) contains 22 as substring.
It is a Harshad number since it is a multiple of its sum of digits (21).
It is a congruent number.
It is not an unprimeable number, because it can be changed into a prime (1050010610041) by changing a digit.
It is a polite number, since it can be written in 63 ways as a sum of consecutive naturals, for example, 133195426 + ... + 133203308.
It is an arithmetic number, because the mean of its divisors is an integer number (26490240000).
Almost surely, 21050010610061 is an apocalyptic number.
It is an amenable number.
1050010610061 is a deficient number, since it is larger than the sum of its proper divisors (645364749939).
1050010610061 is a wasteful number, since it uses less digits than its factorization.
1050010610061 is an evil number, because the sum of its binary digits is even.
The sum of its prime factors is 10078.
The product of its (nonzero) digits is 180, while the sum is 21.
Adding to 1050010610061 its reverse (1600160100501), we get a palindrome (2650170710562).
The spelling of 1050010610061 in words is "one trillion, fifty billion, ten million, six hundred ten thousand, sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.068 sec. • engine limits •