Base | Representation |
---|---|
bin | 10000001100110110100… |
… | …100111010100011110001 |
3 | 10221102122122021101122222 |
4 | 100030312210322203301 |
5 | 121220030404120434 |
6 | 2211240515410425 |
7 | 143301625234241 |
oct | 20146644724361 |
9 | 3842578241588 |
10 | 1113312176369 |
11 | 39a175777148 |
12 | 15b925bb3a15 |
13 | 80ca5a4c103 |
14 | 3bc55495b21 |
15 | 1de5e51972e |
hex | 1033693a8f1 |
1113312176369 has 2 divisors, whose sum is σ = 1113312176370. Its totient is φ = 1113312176368.
The previous prime is 1113312176321. The next prime is 1113312176407. The reversal of 1113312176369 is 9636712133111.
It is a strong prime.
It can be written as a sum of positive squares in only one way, i.e., 954796716769 + 158515459600 = 977137^2 + 398140^2 .
It is a cyclic number.
It is not a de Polignac number, because 1113312176369 - 232 = 1109017209073 is a prime.
It is a super-2 number, since 2×11133121763692 (a number of 25 digits) contains 22 as substring.
It is a Sophie Germain prime.
It is a Curzon number.
It is not a weakly prime, because it can be changed into another prime (1113312176069) 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, 556656088184 + 556656088185.
It is an arithmetic number, because the mean of its divisors is an integer number (556656088185).
Almost surely, 21113312176369 is an apocalyptic number.
It is an amenable number.
1113312176369 is a deficient number, since it is larger than the sum of its proper divisors (1).
1113312176369 is an equidigital number, since it uses as much as digits as its factorization.
1113312176369 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 122472, while the sum is 44.
The spelling of 1113312176369 in words is "one trillion, one hundred thirteen billion, three hundred twelve million, one hundred seventy-six thousand, three hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.074 sec. • engine limits •