Base | Representation |
---|---|
bin | 11110100011111101110… |
… | …01100110111100000001 |
3 | 10201101111100101112012121 |
4 | 33101332321212330001 |
5 | 114201101332114022 |
6 | 2122224301524241 |
7 | 135603324442345 |
oct | 17217671467401 |
9 | 3641440345177 |
10 | 1050101051137 |
11 | 375388738186 |
12 | 14b624873681 |
13 | 78040c59628 |
14 | 38b7a35d625 |
15 | 1c4aee1c2c7 |
hex | f47ee66f01 |
1050101051137 has 2 divisors, whose sum is σ = 1050101051138. Its totient is φ = 1050101051136.
The previous prime is 1050101051113. The next prime is 1050101051231. The reversal of 1050101051137 is 7311501010501.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 1037268919296 + 12832131841 = 1018464^2 + 113279^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1050101051137 is a prime.
It is a super-2 number, since 2×10501010511372 (a number of 25 digits) contains 22 as substring.
It is not a weakly prime, because it can be changed into another prime (1050101051107) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (23) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 525050525568 + 525050525569.
It is an arithmetic number, because the mean of its divisors is an integer number (525050525569).
Almost surely, 21050101051137 is an apocalyptic number.
It is an amenable number.
1050101051137 is a deficient number, since it is larger than the sum of its proper divisors (1).
1050101051137 is an equidigital number, since it uses as much as digits as its factorization.
1050101051137 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 525, while the sum is 25.
Adding to 1050101051137 its reverse (7311501010501), we get a palindrome (8361602061638).
The spelling of 1050101051137 in words is "one trillion, fifty billion, one hundred one million, fifty-one thousand, one hundred thirty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.067 sec. • engine limits •