Base | Representation |
---|---|
bin | 10000001100110111101… |
… | …000111001111111110001 |
3 | 10221102200212210220220011 |
4 | 100030313220321333301 |
5 | 121220044434443412 |
6 | 2211242353414521 |
7 | 143302232566615 |
oct | 20146750717761 |
9 | 3842625726804 |
10 | 1113329999857 |
11 | 39a1848401a9 |
12 | 15b92bb6a441 |
13 | 80ca964c95a |
14 | 3bc579b5345 |
15 | 1de60d8a7a7 |
hex | 10337a39ff1 |
1113329999857 has 2 divisors, whose sum is σ = 1113329999858. Its totient is φ = 1113329999856.
The previous prime is 1113329999819. The next prime is 1113329999861. The reversal of 1113329999857 is 7589999233111.
It is a happy number.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 1019381006736 + 93948993121 = 1009644^2 + 306511^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-1113329999857 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 1113329999792 and 1113329999801.
It is not a weakly prime, because it can be changed into another prime (1113329999807) 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, 556664999928 + 556664999929.
It is an arithmetic number, because the mean of its divisors is an integer number (556664999929).
Almost surely, 21113329999857 is an apocalyptic number.
It is an amenable number.
1113329999857 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113329999857 is an equidigital number, since it uses as much as digits as its factorization.
1113329999857 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 33067440, while the sum is 67.
The spelling of 1113329999857 in words is "one trillion, one hundred thirteen billion, three hundred twenty-nine million, nine hundred ninety-nine thousand, eight hundred fifty-seven".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.083 sec. • engine limits •