Base | Representation |
---|---|
bin | 10101000100101000… |
… | …00111001000010101 |
3 | 1002012102121211012001 |
4 | 22202110013020111 |
5 | 141132124200134 |
6 | 5110331155301 |
7 | 550230616342 |
oct | 124224071025 |
9 | 32172554161 |
10 | 11313115669 |
11 | 4885a60279 |
12 | 22388a5b31 |
13 | 10b3a681ab |
14 | 7946d97c9 |
15 | 4632de414 |
hex | 2a2507215 |
11313115669 has 2 divisors, whose sum is σ = 11313115670. Its totient is φ = 11313115668.
The previous prime is 11313115643. The next prime is 11313115703. The reversal of 11313115669 is 96651131311.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 10585734769 + 727380900 = 102887^2 + 26970^2 .
It is a cyclic number.
It is not a de Polignac number, because 11313115669 - 25 = 11313115637 is a prime.
It is a super-2 number, since 2×113131156692 (a number of 21 digits) contains 22 as substring.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11313115369) 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, 5656557834 + 5656557835.
It is an arithmetic number, because the mean of its divisors is an integer number (5656557835).
Almost surely, 211313115669 is an apocalyptic number.
It is an amenable number.
11313115669 is a deficient number, since it is larger than the sum of its proper divisors (1).
11313115669 is an equidigital number, since it uses as much as digits as its factorization.
11313115669 is an odious number, because the sum of its binary digits is odd.
The product of its digits is 14580, while the sum is 37.
The spelling of 11313115669 in words is "eleven billion, three hundred thirteen million, one hundred fifteen thousand, six hundred sixty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.070 sec. • engine limits •