Base | Representation |
---|---|
bin | 100111100101000… |
… | …0110111111001111 |
3 | 10102112221221021202 |
4 | 1033022012333033 |
5 | 10204440101002 |
6 | 335440420115 |
7 | 44624145155 |
oct | 11712067717 |
9 | 3375857252 |
10 | 1328050127 |
11 | 621716798 |
12 | 31091763b |
13 | 1821a95a1 |
14 | c85433d5 |
15 | 7b8d1502 |
hex | 4f286fcf |
1328050127 has 2 divisors, whose sum is σ = 1328050128. Its totient is φ = 1328050126.
The previous prime is 1328050123. The next prime is 1328050219. The reversal of 1328050127 is 7210508231.
It is a weak prime.
It is a cyclic number.
It is not a de Polignac number, because 1328050127 - 22 = 1328050123 is a prime.
It is a super-2 number, since 2×13280501272 = 3527434279649432258, which contains 22 as substring.
It is a self number, because there is not a number n which added to its sum of digits gives 1328050127.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1328050123) 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, 664025063 + 664025064.
It is an arithmetic number, because the mean of its divisors is an integer number (664025064).
Almost surely, 21328050127 is an apocalyptic number.
1328050127 is a deficient number, since it is larger than the sum of its proper divisors (1).
1328050127 is an equidigital number, since it uses as much as digits as its factorization.
1328050127 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 3360, while the sum is 29.
The square root of 1328050127 is about 36442.4220792197. The cubic root of 1328050127 is about 1099.1867617249.
Adding to 1328050127 its reverse (7210508231), we get a palindrome (8538558358).
The spelling of 1328050127 in words is "one billion, three hundred twenty-eight million, fifty thousand, one hundred twenty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.080 sec. • engine limits •