Base | Representation |
---|---|
bin | 10000001100110110101… |
… | …000101101000001111101 |
3 | 10221102122201010212000211 |
4 | 100030312220231001331 |
5 | 121220031132411113 |
6 | 2211240552552421 |
7 | 143301636541615 |
oct | 20146650550175 |
9 | 3842581125024 |
10 | 1113313169533 |
11 | 39a176295344 |
12 | 15b9263b2711 |
13 | 80ca6009196 |
14 | 3bc55673a45 |
15 | 1de5e663b3d |
hex | 10336a2d07d |
1113313169533 has 2 divisors, whose sum is σ = 1113313169534. Its totient is φ = 1113313169532.
The previous prime is 1113313169489. The next prime is 1113313169543. The reversal of 1113313169533 is 3359613133111.
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., 976355443449 + 136957726084 = 988107^2 + 370078^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113313169533 - 233 = 1104723234941 is a prime.
It is a super-2 number, since 2×11133131695332 (a number of 25 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (1113313169543) 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, 556656584766 + 556656584767.
It is an arithmetic number, because the mean of its divisors is an integer number (556656584767).
Almost surely, 21113313169533 is an apocalyptic number.
It is an amenable number.
1113313169533 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113313169533 is an equidigital number, since it uses as much as digits as its factorization.
1113313169533 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 65610, while the sum is 40.
The spelling of 1113313169533 in words is "one trillion, one hundred thirteen billion, three hundred thirteen million, one hundred sixty-nine thousand, five hundred thirty-three".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.071 sec. • engine limits •