Base | Representation |
---|---|
bin | 11101000110111001001… |
… | …00101100100111011111 |
3 | 10112121111222201112210102 |
4 | 32203130210230213133 |
5 | 112341233023121002 |
6 | 2043242121331315 |
7 | 132154141255553 |
oct | 16433444544737 |
9 | 3477458645712 |
10 | 1000133020127 |
11 | 35617701a98a |
12 | 1419ba636b3b |
13 | 73409a00b87 |
14 | 36599d91863 |
15 | 1b03828ea02 |
hex | e8dc92c9df |
1000133020127 has 2 divisors, whose sum is σ = 1000133020128. Its totient is φ = 1000133020126.
The previous prime is 1000133020099. The next prime is 1000133020189. The reversal of 1000133020127 is 7210203310001.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1000133020127 - 216 = 1000132954591 is a prime.
It is a super-2 number, since 2×10001330201272 (a number of 25 digits) contains 22 as substring.
It is a junction number, because it is equal to n+sod(n) for n = 1000133020099 and 1000133020108.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1000133020927) 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, 500066510063 + 500066510064.
It is an arithmetic number, because the mean of its divisors is an integer number (500066510064).
Almost surely, 21000133020127 is an apocalyptic number.
1000133020127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1000133020127 is an equidigital number, since it uses as much as digits as its factorization.
1000133020127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 252, while the sum is 20.
Adding to 1000133020127 its reverse (7210203310001), we get a palindrome (8210336330128).
The spelling of 1000133020127 in words is "one trillion, one hundred thirty-three million, twenty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •