Base | Representation |
---|---|
bin | 11110100100101110100… |
… | …11111100111011110001 |
3 | 10201102112220001021120100 |
4 | 33102113103330323301 |
5 | 114202421204011121 |
6 | 2122333052103013 |
7 | 135616426566105 |
oct | 17222723747361 |
9 | 3642486037510 |
10 | 1050510610161 |
11 | 375578941a11 |
12 | 14b719a64a69 |
13 | 780a7a66b4c |
14 | 38bb88d1905 |
15 | 1c4d5d6d026 |
hex | f4974fcef1 |
1050510610161 has 48 divisors (see below), whose sum is σ = 1589329048320. Its totient is φ = 667960888320.
The previous prime is 1050510610139. The next prime is 1050510610183. The reversal of 1050510610161 is 1610160150501.
It is an interprime number because it is at equal distance from previous prime (1050510610139) and next prime (1050510610183).
It is not a de Polignac number, because 1050510610161 - 214 = 1050510593777 is a prime.
It is a super-2 number, since 2×10505106101612 (a number of 25 digits) contains 22 as substring.
It is a Curzon number.
It is not an unprimeable number, because it can be changed into a prime (1050510610661) by changing a digit.
It is a polite number, since it can be written in 47 ways as a sum of consecutive naturals, for example, 6859656 + ... + 7011126.
It is an arithmetic number, because the mean of its divisors is an integer number (33111021840).
Almost surely, 21050510610161 is an apocalyptic number.
It is an amenable number.
1050510610161 is a deficient number, since it is larger than the sum of its proper divisors (538818438159).
1050510610161 is a wasteful number, since it uses less digits than its factorization.
1050510610161 is an odious number, because the sum of its binary digits is odd.
The sum of its prime factors is 151926 (or 151923 counting only the distinct ones).
The product of its (nonzero) digits is 900, while the sum is 27.
Adding to 1050510610161 its reverse (1610160150501), we get a palindrome (2660670760662).
The spelling of 1050510610161 in words is "one trillion, fifty billion, five hundred ten million, six hundred ten thousand, one hundred sixty-one".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.069 sec. • engine limits •