Base | Representation |
---|---|
bin | 11110100011110010011… |
… | …11010000000001000111 |
3 | 10201101020201122112102002 |
4 | 33101321033100001013 |
5 | 114200403022424002 |
6 | 2122211025535515 |
7 | 135601062154502 |
oct | 17217117200107 |
9 | 3641221575362 |
10 | 1050006061127 |
11 | 37533a058841 |
12 | 14b5b8aa459b |
13 | 7802737b31a |
14 | 38b6b8b4139 |
15 | 1c4a6907002 |
hex | f4793d0047 |
1050006061127 has 2 divisors, whose sum is σ = 1050006061128. Its totient is φ = 1050006061126.
The previous prime is 1050006061019. The next prime is 1050006061151. The reversal of 1050006061127 is 7211606000501.
It is a strong prime.
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1050006061127 is a prime.
It is a super-2 number, since 2×10500060611272 (a number of 25 digits) contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1050006061127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1050006061927) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (19) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525003030563 + 525003030564.
It is an arithmetic number, because the mean of its divisors is an integer number (525003030564).
Almost surely, 21050006061127 is an apocalyptic number.
1050006061127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050006061127 is an equidigital number, since it uses as much as digits as its factorization.
1050006061127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 2520, while the sum is 29.
The spelling of 1050006061127 in words is "one trillion, fifty billion, six million, sixty-one thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.090 sec. • engine limits •