Base | Representation |
---|---|
bin | 100000110100100… |
… | …1111001010100001 |
3 | 2211202100022110002 |
4 | 1001221033022201 |
5 | 4223420012212 |
6 | 301141145345 |
7 | 36202066613 |
oct | 10151171241 |
9 | 2752308402 |
10 | 1101329057 |
11 | 515742904 |
12 | 2689bb255 |
13 | 1472278ca |
14 | a63a6db3 |
15 | 66a49ac2 |
hex | 41a4f2a1 |
1101329057 has 2 divisors, whose sum is σ = 1101329058. Its totient is φ = 1101329056.
The previous prime is 1101328997. The next prime is 1101329077. The reversal of 1101329057 is 7509231011.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 758671936 + 342657121 = 27544^2 + 18511^2 .
It is an emirp because it is prime and its reverse (7509231011) is a distict prime.
It is a cyclic number.
It is not a de Polignac number, because 1101329057 - 28 = 1101328801 is a prime.
It is not a weakly prime, because it can be changed into another prime (1101329077) by changing a digit.
It is a pernicious number, because its binary representation contains a prime number (13) of ones.
It is a polite number, since it can be written as a sum of consecutive naturals, namely, 550664528 + 550664529.
It is an arithmetic number, because the mean of its divisors is an integer number (550664529).
Almost surely, 21101329057 is an apocalyptic number.
It is an amenable number.
1101329057 is a deficient number, since it is larger than the sum of its proper divisors (1).
1101329057 is an equidigital number, since it uses as much as digits as its factorization.
1101329057 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1890, while the sum is 29.
The square root of 1101329057 is about 33186.2781432326. The cubic root of 1101329057 is about 1032.6956933154.
The spelling of 1101329057 in words is "one billion, one hundred one million, three hundred twenty-nine thousand, fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.073 sec. • engine limits •