Base | Representation |
---|---|
bin | 1010011000011110110010… |
… | …0000011100000110010101 |
3 | 1111102022220111002002121021 |
4 | 2212013230200130012111 |
5 | 2444013321141012044 |
6 | 40140144240121141 |
7 | 2255520406151113 |
oct | 246075440340625 |
9 | 44368814062537 |
10 | 11415696032149 |
11 | 3701407892602 |
12 | 13445316061b1 |
13 | 64a65985b786 |
14 | 2b6746182ab3 |
15 | 14be36053e84 |
hex | a61ec81c195 |
11415696032149 has 2 divisors, whose sum is σ = 11415696032150. Its totient is φ = 11415696032148.
The previous prime is 11415696032137. The next prime is 11415696032171. The reversal of 11415696032149 is 94123069651411.
It is a weak prime.
It can be written as a sum of positive squares in only one way, i.e., 5865817583025 + 5549878449124 = 2421945^2 + 2355818^2 .
It is a cyclic number.
It is a de Polignac number, because none of the positive numbers 2k-11415696032149 is a prime.
It is a junction number, because it is equal to n+sod(n) for n = 11415696032096 and 11415696032105.
It is a congruent number.
It is not a weakly prime, because it can be changed into another prime (11415696032549) 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, 5707848016074 + 5707848016075.
It is an arithmetic number, because the mean of its divisors is an integer number (5707848016075).
Almost surely, 211415696032149 is an apocalyptic number.
It is an amenable number.
11415696032149 is a deficient number, since it is larger than the sum of its proper divisors (1).
11415696032149 is an equidigital number, since it uses as much as digits as its factorization.
11415696032149 is an odious number, because the sum of its binary digits is odd.
The product of its (nonzero) digits is 1399680, while the sum is 52.
The spelling of 11415696032149 in words is "eleven trillion, four hundred fifteen billion, six hundred ninety-six million, thirty-two thousand, one hundred forty-nine".
• e-mail: info -at- numbersaplenty.com • Privacy notice • done in 0.072 sec. • engine limits •